292.22/254.84 YES 292.22/254.84 292.22/254.84 Ultimate: Cannot open display: 292.22/254.84 This is Ultimate 0.1.24-8dc7c08-m 292.22/254.84 [2019-03-28 12:43:31,856 INFO L170 SettingsManager]: Resetting all preferences to default values... 292.22/254.84 [2019-03-28 12:43:31,858 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 292.22/254.84 [2019-03-28 12:43:31,869 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 292.22/254.84 [2019-03-28 12:43:31,870 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 292.22/254.84 [2019-03-28 12:43:31,871 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 292.22/254.84 [2019-03-28 12:43:31,872 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 292.22/254.84 [2019-03-28 12:43:31,874 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 292.22/254.84 [2019-03-28 12:43:31,875 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 292.22/254.84 [2019-03-28 12:43:31,876 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 292.22/254.84 [2019-03-28 12:43:31,877 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 292.22/254.84 [2019-03-28 12:43:31,877 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 292.22/254.84 [2019-03-28 12:43:31,878 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 292.22/254.84 [2019-03-28 12:43:31,879 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 292.22/254.84 [2019-03-28 12:43:31,880 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 292.22/254.84 [2019-03-28 12:43:31,880 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 292.22/254.84 [2019-03-28 12:43:31,881 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 292.22/254.84 [2019-03-28 12:43:31,883 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 292.22/254.84 [2019-03-28 12:43:31,885 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 292.22/254.84 [2019-03-28 12:43:31,886 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 292.22/254.84 [2019-03-28 12:43:31,887 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 292.22/254.84 [2019-03-28 12:43:31,889 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 292.22/254.84 [2019-03-28 12:43:31,891 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 292.22/254.84 [2019-03-28 12:43:31,891 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 292.22/254.84 [2019-03-28 12:43:31,891 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 292.22/254.84 [2019-03-28 12:43:31,892 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 292.22/254.84 [2019-03-28 12:43:31,893 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 292.22/254.84 [2019-03-28 12:43:31,894 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 292.22/254.84 [2019-03-28 12:43:31,894 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 292.22/254.84 [2019-03-28 12:43:31,895 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 292.22/254.84 [2019-03-28 12:43:31,895 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 292.22/254.84 [2019-03-28 12:43:31,896 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 292.22/254.84 [2019-03-28 12:43:31,897 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 292.22/254.84 [2019-03-28 12:43:31,897 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 292.22/254.84 [2019-03-28 12:43:31,898 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 292.22/254.84 [2019-03-28 12:43:31,898 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 292.22/254.84 [2019-03-28 12:43:31,898 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 292.22/254.84 [2019-03-28 12:43:31,899 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 292.22/254.84 [2019-03-28 12:43:31,900 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 292.22/254.84 [2019-03-28 12:43:31,900 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 292.22/254.84 [2019-03-28 12:43:31,915 INFO L110 SettingsManager]: Loading preferences was successful 292.22/254.84 [2019-03-28 12:43:31,915 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 292.22/254.84 [2019-03-28 12:43:31,916 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 292.22/254.84 [2019-03-28 12:43:31,916 INFO L133 SettingsManager]: * Rewrite not-equals=true 292.22/254.84 [2019-03-28 12:43:31,916 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 292.22/254.84 [2019-03-28 12:43:31,916 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 292.22/254.84 [2019-03-28 12:43:31,917 INFO L133 SettingsManager]: * Use SBE=true 292.22/254.84 [2019-03-28 12:43:31,917 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 292.22/254.84 [2019-03-28 12:43:31,917 INFO L133 SettingsManager]: * Use old map elimination=false 292.22/254.84 [2019-03-28 12:43:31,917 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 292.22/254.84 [2019-03-28 12:43:31,917 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 292.22/254.84 [2019-03-28 12:43:31,917 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 292.22/254.84 [2019-03-28 12:43:31,918 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 292.22/254.84 [2019-03-28 12:43:31,918 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 292.22/254.84 [2019-03-28 12:43:31,918 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 292.22/254.84 [2019-03-28 12:43:31,918 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 292.22/254.84 [2019-03-28 12:43:31,918 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 292.22/254.84 [2019-03-28 12:43:31,919 INFO L133 SettingsManager]: * Check division by zero=IGNORE 292.22/254.84 [2019-03-28 12:43:31,919 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 292.22/254.84 [2019-03-28 12:43:31,919 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 292.22/254.84 [2019-03-28 12:43:31,919 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 292.22/254.84 [2019-03-28 12:43:31,919 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 292.22/254.84 [2019-03-28 12:43:31,919 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 292.22/254.84 [2019-03-28 12:43:31,920 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 292.22/254.84 [2019-03-28 12:43:31,920 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 292.22/254.84 [2019-03-28 12:43:31,920 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 292.22/254.84 [2019-03-28 12:43:31,920 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 292.22/254.84 [2019-03-28 12:43:31,920 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 292.22/254.84 [2019-03-28 12:43:31,920 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 292.22/254.84 [2019-03-28 12:43:31,945 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 292.22/254.84 [2019-03-28 12:43:31,958 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 292.22/254.84 [2019-03-28 12:43:31,962 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 292.22/254.84 [2019-03-28 12:43:31,963 INFO L271 PluginConnector]: Initializing CDTParser... 292.22/254.84 [2019-03-28 12:43:31,964 INFO L276 PluginConnector]: CDTParser initialized 292.22/254.84 [2019-03-28 12:43:31,964 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 292.22/254.84 [2019-03-28 12:43:32,022 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/3c947e84713b4505b64523e94536860e/FLAG69ded6ec9 292.22/254.84 [2019-03-28 12:43:32,363 INFO L307 CDTParser]: Found 1 translation units. 292.22/254.84 [2019-03-28 12:43:32,364 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 292.22/254.84 [2019-03-28 12:43:32,364 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 292.22/254.84 [2019-03-28 12:43:32,371 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/3c947e84713b4505b64523e94536860e/FLAG69ded6ec9 292.22/254.84 [2019-03-28 12:43:32,766 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/3c947e84713b4505b64523e94536860e 292.22/254.84 [2019-03-28 12:43:32,778 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 292.22/254.84 [2019-03-28 12:43:32,779 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 292.22/254.84 [2019-03-28 12:43:32,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 292.22/254.84 [2019-03-28 12:43:32,781 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 292.22/254.84 [2019-03-28 12:43:32,784 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 292.22/254.84 [2019-03-28 12:43:32,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:43:32" (1/1) ... 292.22/254.84 [2019-03-28 12:43:32,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@615e0acb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:32, skipping insertion in model container 292.22/254.84 [2019-03-28 12:43:32,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:43:32" (1/1) ... 292.22/254.84 [2019-03-28 12:43:32,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 292.22/254.84 [2019-03-28 12:43:32,814 INFO L176 MainTranslator]: Built tables and reachable declarations 292.22/254.84 [2019-03-28 12:43:32,983 INFO L206 PostProcessor]: Analyzing one entry point: main 292.22/254.84 [2019-03-28 12:43:32,995 INFO L191 MainTranslator]: Completed pre-run 292.22/254.84 [2019-03-28 12:43:33,076 INFO L206 PostProcessor]: Analyzing one entry point: main 292.22/254.84 [2019-03-28 12:43:33,093 INFO L195 MainTranslator]: Completed translation 292.22/254.84 [2019-03-28 12:43:33,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:33 WrapperNode 292.22/254.84 [2019-03-28 12:43:33,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 292.22/254.84 [2019-03-28 12:43:33,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 292.22/254.84 [2019-03-28 12:43:33,094 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 292.22/254.84 [2019-03-28 12:43:33,094 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 292.22/254.84 [2019-03-28 12:43:33,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:33" (1/1) ... 292.22/254.84 [2019-03-28 12:43:33,115 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:33" (1/1) ... 292.22/254.84 [2019-03-28 12:43:33,139 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 292.22/254.84 [2019-03-28 12:43:33,140 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 292.22/254.84 [2019-03-28 12:43:33,140 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 292.22/254.84 [2019-03-28 12:43:33,140 INFO L276 PluginConnector]: Boogie Preprocessor initialized 292.22/254.84 [2019-03-28 12:43:33,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:33" (1/1) ... 292.22/254.84 [2019-03-28 12:43:33,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:33" (1/1) ... 292.22/254.84 [2019-03-28 12:43:33,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:33" (1/1) ... 292.22/254.84 [2019-03-28 12:43:33,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:33" (1/1) ... 292.22/254.84 [2019-03-28 12:43:33,159 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:33" (1/1) ... 292.22/254.84 [2019-03-28 12:43:33,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:33" (1/1) ... 292.22/254.84 [2019-03-28 12:43:33,166 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:33" (1/1) ... 292.22/254.84 [2019-03-28 12:43:33,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 292.22/254.84 [2019-03-28 12:43:33,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 292.22/254.84 [2019-03-28 12:43:33,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... 292.22/254.84 [2019-03-28 12:43:33,170 INFO L276 PluginConnector]: RCFGBuilder initialized 292.22/254.84 [2019-03-28 12:43:33,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:33" (1/1) ... 292.22/254.84 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 292.22/254.84 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 292.22/254.84 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 292.22/254.84 [2019-03-28 12:43:33,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 292.22/254.84 [2019-03-28 12:43:33,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 292.22/254.84 [2019-03-28 12:43:33,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 292.22/254.84 [2019-03-28 12:43:33,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 292.22/254.84 [2019-03-28 12:43:33,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 292.22/254.84 [2019-03-28 12:43:33,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 292.22/254.84 [2019-03-28 12:43:33,526 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 292.22/254.84 [2019-03-28 12:43:33,526 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. 292.22/254.84 [2019-03-28 12:43:33,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:43:33 BoogieIcfgContainer 292.22/254.84 [2019-03-28 12:43:33,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 292.22/254.84 [2019-03-28 12:43:33,528 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 292.22/254.84 [2019-03-28 12:43:33,529 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 292.22/254.84 [2019-03-28 12:43:33,531 INFO L276 PluginConnector]: BlockEncodingV2 initialized 292.22/254.84 [2019-03-28 12:43:33,532 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:43:33" (1/1) ... 292.22/254.84 [2019-03-28 12:43:33,551 INFO L313 BlockEncoder]: Initial Icfg 40 locations, 47 edges 292.22/254.84 [2019-03-28 12:43:33,554 INFO L258 BlockEncoder]: Using Remove infeasible edges 292.22/254.84 [2019-03-28 12:43:33,555 INFO L263 BlockEncoder]: Using Maximize final states 292.22/254.84 [2019-03-28 12:43:33,556 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 292.22/254.84 [2019-03-28 12:43:33,556 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 292.22/254.84 [2019-03-28 12:43:33,558 INFO L296 BlockEncoder]: Using Remove sink states 292.22/254.84 [2019-03-28 12:43:33,559 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 292.22/254.84 [2019-03-28 12:43:33,559 INFO L179 BlockEncoder]: Using Rewrite not-equals 292.22/254.84 [2019-03-28 12:43:33,586 INFO L185 BlockEncoder]: Using Use SBE 292.22/254.84 [2019-03-28 12:43:33,619 INFO L200 BlockEncoder]: SBE split 19 edges 292.22/254.84 [2019-03-28 12:43:33,624 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 292.22/254.84 [2019-03-28 12:43:33,626 INFO L71 MaximizeFinalStates]: 0 new accepting states 292.22/254.84 [2019-03-28 12:43:33,650 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding 292.22/254.84 [2019-03-28 12:43:33,653 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states 292.22/254.84 [2019-03-28 12:43:33,654 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 292.22/254.84 [2019-03-28 12:43:33,655 INFO L71 MaximizeFinalStates]: 0 new accepting states 292.22/254.84 [2019-03-28 12:43:33,661 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 292.22/254.84 [2019-03-28 12:43:33,662 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 292.22/254.84 [2019-03-28 12:43:33,663 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 292.22/254.84 [2019-03-28 12:43:33,663 INFO L71 MaximizeFinalStates]: 0 new accepting states 292.22/254.84 [2019-03-28 12:43:33,663 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 292.22/254.84 [2019-03-28 12:43:33,664 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 292.22/254.84 [2019-03-28 12:43:33,664 INFO L313 BlockEncoder]: Encoded RCFG 30 locations, 64 edges 292.22/254.84 [2019-03-28 12:43:33,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:43:33 BasicIcfg 292.22/254.84 [2019-03-28 12:43:33,665 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 292.22/254.84 [2019-03-28 12:43:33,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 292.22/254.84 [2019-03-28 12:43:33,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... 292.22/254.84 [2019-03-28 12:43:33,669 INFO L276 PluginConnector]: TraceAbstraction initialized 292.22/254.84 [2019-03-28 12:43:33,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:43:32" (1/4) ... 292.22/254.84 [2019-03-28 12:43:33,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451bca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:43:33, skipping insertion in model container 292.22/254.84 [2019-03-28 12:43:33,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:33" (2/4) ... 292.22/254.84 [2019-03-28 12:43:33,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451bca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:43:33, skipping insertion in model container 292.22/254.84 [2019-03-28 12:43:33,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:43:33" (3/4) ... 292.22/254.84 [2019-03-28 12:43:33,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451bca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:43:33, skipping insertion in model container 292.22/254.84 [2019-03-28 12:43:33,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:43:33" (4/4) ... 292.22/254.84 [2019-03-28 12:43:33,674 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 292.22/254.84 [2019-03-28 12:43:33,683 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 292.22/254.84 [2019-03-28 12:43:33,692 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. 292.22/254.84 [2019-03-28 12:43:33,709 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. 292.22/254.84 [2019-03-28 12:43:33,739 INFO L133 ementStrategyFactory]: Using default assertion order modulation 292.22/254.84 [2019-03-28 12:43:33,739 INFO L382 AbstractCegarLoop]: Interprodecural is true 292.22/254.84 [2019-03-28 12:43:33,740 INFO L383 AbstractCegarLoop]: Hoare is true 292.22/254.84 [2019-03-28 12:43:33,740 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 292.22/254.84 [2019-03-28 12:43:33,740 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 292.22/254.84 [2019-03-28 12:43:33,740 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 292.22/254.84 [2019-03-28 12:43:33,740 INFO L387 AbstractCegarLoop]: Difference is false 292.22/254.84 [2019-03-28 12:43:33,740 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 292.22/254.84 [2019-03-28 12:43:33,741 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 292.22/254.84 [2019-03-28 12:43:33,756 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. 292.22/254.84 [2019-03-28 12:43:33,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 292.22/254.84 [2019-03-28 12:43:33,762 INFO L394 BasicCegarLoop]: Found error trace 292.22/254.84 [2019-03-28 12:43:33,762 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 292.22/254.84 [2019-03-28 12:43:33,763 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 292.22/254.84 [2019-03-28 12:43:33,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.84 [2019-03-28 12:43:33,768 INFO L82 PathProgramCache]: Analyzing trace with hash 218260429, now seen corresponding path program 1 times 292.22/254.84 [2019-03-28 12:43:33,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.84 [2019-03-28 12:43:33,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.84 [2019-03-28 12:43:33,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:33,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:33,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.84 [2019-03-28 12:43:33,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.84 [2019-03-28 12:43:33,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 292.22/254.84 [2019-03-28 12:43:33,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 292.22/254.84 [2019-03-28 12:43:33,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 292.22/254.84 [2019-03-28 12:43:33,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 292.22/254.84 [2019-03-28 12:43:33,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 292.22/254.84 [2019-03-28 12:43:33,980 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. 292.22/254.84 [2019-03-28 12:43:34,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 292.22/254.84 [2019-03-28 12:43:34,144 INFO L93 Difference]: Finished difference Result 50 states and 109 transitions. 292.22/254.84 [2019-03-28 12:43:34,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 292.22/254.84 [2019-03-28 12:43:34,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 292.22/254.84 [2019-03-28 12:43:34,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 292.22/254.84 [2019-03-28 12:43:34,160 INFO L225 Difference]: With dead ends: 50 292.22/254.84 [2019-03-28 12:43:34,160 INFO L226 Difference]: Without dead ends: 29 292.22/254.84 [2019-03-28 12:43:34,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 292.22/254.84 [2019-03-28 12:43:34,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 292.22/254.84 [2019-03-28 12:43:34,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. 292.22/254.84 [2019-03-28 12:43:34,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 292.22/254.84 [2019-03-28 12:43:34,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 60 transitions. 292.22/254.84 [2019-03-28 12:43:34,204 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 60 transitions. Word has length 5 292.22/254.84 [2019-03-28 12:43:34,205 INFO L84 Accepts]: Finished accepts. word is rejected. 292.22/254.84 [2019-03-28 12:43:34,205 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 60 transitions. 292.22/254.84 [2019-03-28 12:43:34,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 292.22/254.84 [2019-03-28 12:43:34,206 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 60 transitions. 292.22/254.84 [2019-03-28 12:43:34,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 292.22/254.84 [2019-03-28 12:43:34,206 INFO L394 BasicCegarLoop]: Found error trace 292.22/254.84 [2019-03-28 12:43:34,206 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 292.22/254.84 [2019-03-28 12:43:34,206 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 292.22/254.84 [2019-03-28 12:43:34,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.84 [2019-03-28 12:43:34,207 INFO L82 PathProgramCache]: Analyzing trace with hash 218260431, now seen corresponding path program 1 times 292.22/254.84 [2019-03-28 12:43:34,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.84 [2019-03-28 12:43:34,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.84 [2019-03-28 12:43:34,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:34,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:34,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.84 [2019-03-28 12:43:34,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.84 [2019-03-28 12:43:34,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 292.22/254.84 [2019-03-28 12:43:34,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 292.22/254.84 [2019-03-28 12:43:34,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 292.22/254.84 [2019-03-28 12:43:34,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 292.22/254.84 [2019-03-28 12:43:34,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 292.22/254.84 [2019-03-28 12:43:34,247 INFO L87 Difference]: Start difference. First operand 29 states and 60 transitions. Second operand 4 states. 292.22/254.84 [2019-03-28 12:43:34,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 292.22/254.84 [2019-03-28 12:43:34,337 INFO L93 Difference]: Finished difference Result 30 states and 60 transitions. 292.22/254.84 [2019-03-28 12:43:34,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 292.22/254.84 [2019-03-28 12:43:34,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 292.22/254.84 [2019-03-28 12:43:34,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 292.22/254.84 [2019-03-28 12:43:34,339 INFO L225 Difference]: With dead ends: 30 292.22/254.84 [2019-03-28 12:43:34,339 INFO L226 Difference]: Without dead ends: 29 292.22/254.84 [2019-03-28 12:43:34,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 292.22/254.84 [2019-03-28 12:43:34,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 292.22/254.84 [2019-03-28 12:43:34,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. 292.22/254.84 [2019-03-28 12:43:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 292.22/254.84 [2019-03-28 12:43:34,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 59 transitions. 292.22/254.84 [2019-03-28 12:43:34,346 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 59 transitions. Word has length 5 292.22/254.84 [2019-03-28 12:43:34,346 INFO L84 Accepts]: Finished accepts. word is rejected. 292.22/254.84 [2019-03-28 12:43:34,346 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 59 transitions. 292.22/254.84 [2019-03-28 12:43:34,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 292.22/254.84 [2019-03-28 12:43:34,347 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 59 transitions. 292.22/254.84 [2019-03-28 12:43:34,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 292.22/254.84 [2019-03-28 12:43:34,347 INFO L394 BasicCegarLoop]: Found error trace 292.22/254.84 [2019-03-28 12:43:34,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 292.22/254.84 [2019-03-28 12:43:34,348 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 292.22/254.84 [2019-03-28 12:43:34,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.84 [2019-03-28 12:43:34,348 INFO L82 PathProgramCache]: Analyzing trace with hash 218260432, now seen corresponding path program 1 times 292.22/254.84 [2019-03-28 12:43:34,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.84 [2019-03-28 12:43:34,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.84 [2019-03-28 12:43:34,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:34,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:34,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.84 [2019-03-28 12:43:34,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.84 [2019-03-28 12:43:34,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 292.22/254.84 [2019-03-28 12:43:34,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 292.22/254.84 [2019-03-28 12:43:34,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 292.22/254.84 [2019-03-28 12:43:34,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 292.22/254.84 [2019-03-28 12:43:34,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 292.22/254.84 [2019-03-28 12:43:34,388 INFO L87 Difference]: Start difference. First operand 29 states and 59 transitions. Second operand 3 states. 292.22/254.84 [2019-03-28 12:43:34,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 292.22/254.84 [2019-03-28 12:43:34,514 INFO L93 Difference]: Finished difference Result 29 states and 59 transitions. 292.22/254.84 [2019-03-28 12:43:34,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 292.22/254.84 [2019-03-28 12:43:34,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 292.22/254.84 [2019-03-28 12:43:34,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 292.22/254.84 [2019-03-28 12:43:34,516 INFO L225 Difference]: With dead ends: 29 292.22/254.84 [2019-03-28 12:43:34,516 INFO L226 Difference]: Without dead ends: 28 292.22/254.84 [2019-03-28 12:43:34,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 292.22/254.84 [2019-03-28 12:43:34,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 292.22/254.84 [2019-03-28 12:43:34,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 292.22/254.84 [2019-03-28 12:43:34,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 292.22/254.84 [2019-03-28 12:43:34,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. 292.22/254.84 [2019-03-28 12:43:34,521 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 58 transitions. Word has length 5 292.22/254.84 [2019-03-28 12:43:34,522 INFO L84 Accepts]: Finished accepts. word is rejected. 292.22/254.84 [2019-03-28 12:43:34,522 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 58 transitions. 292.22/254.84 [2019-03-28 12:43:34,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 292.22/254.84 [2019-03-28 12:43:34,522 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 58 transitions. 292.22/254.84 [2019-03-28 12:43:34,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 292.22/254.84 [2019-03-28 12:43:34,522 INFO L394 BasicCegarLoop]: Found error trace 292.22/254.84 [2019-03-28 12:43:34,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 292.22/254.84 [2019-03-28 12:43:34,523 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 292.22/254.84 [2019-03-28 12:43:34,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.84 [2019-03-28 12:43:34,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1823862590, now seen corresponding path program 1 times 292.22/254.84 [2019-03-28 12:43:34,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.84 [2019-03-28 12:43:34,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.84 [2019-03-28 12:43:34,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:34,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:34,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.84 [2019-03-28 12:43:34,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.84 [2019-03-28 12:43:34,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 292.22/254.84 [2019-03-28 12:43:34,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 292.22/254.84 [2019-03-28 12:43:34,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 292.22/254.84 [2019-03-28 12:43:34,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 292.22/254.84 [2019-03-28 12:43:34,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 292.22/254.84 [2019-03-28 12:43:34,561 INFO L87 Difference]: Start difference. First operand 28 states and 58 transitions. Second operand 3 states. 292.22/254.84 [2019-03-28 12:43:34,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 292.22/254.84 [2019-03-28 12:43:34,654 INFO L93 Difference]: Finished difference Result 28 states and 58 transitions. 292.22/254.84 [2019-03-28 12:43:34,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 292.22/254.84 [2019-03-28 12:43:34,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 292.22/254.84 [2019-03-28 12:43:34,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 292.22/254.84 [2019-03-28 12:43:34,655 INFO L225 Difference]: With dead ends: 28 292.22/254.84 [2019-03-28 12:43:34,655 INFO L226 Difference]: Without dead ends: 27 292.22/254.84 [2019-03-28 12:43:34,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 292.22/254.84 [2019-03-28 12:43:34,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 292.22/254.84 [2019-03-28 12:43:34,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 292.22/254.84 [2019-03-28 12:43:34,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 292.22/254.84 [2019-03-28 12:43:34,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 56 transitions. 292.22/254.84 [2019-03-28 12:43:34,660 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 56 transitions. Word has length 6 292.22/254.84 [2019-03-28 12:43:34,660 INFO L84 Accepts]: Finished accepts. word is rejected. 292.22/254.84 [2019-03-28 12:43:34,661 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 56 transitions. 292.22/254.84 [2019-03-28 12:43:34,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 292.22/254.84 [2019-03-28 12:43:34,661 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 56 transitions. 292.22/254.84 [2019-03-28 12:43:34,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 292.22/254.84 [2019-03-28 12:43:34,661 INFO L394 BasicCegarLoop]: Found error trace 292.22/254.84 [2019-03-28 12:43:34,661 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 292.22/254.84 [2019-03-28 12:43:34,662 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 292.22/254.84 [2019-03-28 12:43:34,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.84 [2019-03-28 12:43:34,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1823862589, now seen corresponding path program 1 times 292.22/254.84 [2019-03-28 12:43:34,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.84 [2019-03-28 12:43:34,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.84 [2019-03-28 12:43:34,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:34,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:34,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.84 [2019-03-28 12:43:34,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.84 [2019-03-28 12:43:34,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 292.22/254.84 [2019-03-28 12:43:34,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 292.22/254.84 [2019-03-28 12:43:34,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 292.22/254.84 [2019-03-28 12:43:34,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 292.22/254.84 [2019-03-28 12:43:34,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 292.22/254.84 [2019-03-28 12:43:34,702 INFO L87 Difference]: Start difference. First operand 27 states and 56 transitions. Second operand 4 states. 292.22/254.84 [2019-03-28 12:43:34,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 292.22/254.84 [2019-03-28 12:43:34,778 INFO L93 Difference]: Finished difference Result 28 states and 56 transitions. 292.22/254.84 [2019-03-28 12:43:34,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 292.22/254.84 [2019-03-28 12:43:34,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 292.22/254.84 [2019-03-28 12:43:34,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 292.22/254.84 [2019-03-28 12:43:34,780 INFO L225 Difference]: With dead ends: 28 292.22/254.84 [2019-03-28 12:43:34,780 INFO L226 Difference]: Without dead ends: 27 292.22/254.84 [2019-03-28 12:43:34,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 292.22/254.84 [2019-03-28 12:43:34,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 292.22/254.84 [2019-03-28 12:43:34,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 292.22/254.84 [2019-03-28 12:43:34,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 292.22/254.84 [2019-03-28 12:43:34,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 55 transitions. 292.22/254.84 [2019-03-28 12:43:34,785 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 55 transitions. Word has length 6 292.22/254.84 [2019-03-28 12:43:34,785 INFO L84 Accepts]: Finished accepts. word is rejected. 292.22/254.84 [2019-03-28 12:43:34,786 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 55 transitions. 292.22/254.84 [2019-03-28 12:43:34,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 292.22/254.84 [2019-03-28 12:43:34,786 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 55 transitions. 292.22/254.84 [2019-03-28 12:43:34,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 292.22/254.84 [2019-03-28 12:43:34,786 INFO L394 BasicCegarLoop]: Found error trace 292.22/254.84 [2019-03-28 12:43:34,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 292.22/254.84 [2019-03-28 12:43:34,787 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 292.22/254.84 [2019-03-28 12:43:34,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.84 [2019-03-28 12:43:34,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1823862588, now seen corresponding path program 1 times 292.22/254.84 [2019-03-28 12:43:34,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.84 [2019-03-28 12:43:34,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.84 [2019-03-28 12:43:34,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:34,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:34,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.84 [2019-03-28 12:43:34,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.84 [2019-03-28 12:43:34,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 292.22/254.84 [2019-03-28 12:43:34,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 292.22/254.84 [2019-03-28 12:43:34,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 292.22/254.84 [2019-03-28 12:43:34,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 292.22/254.84 [2019-03-28 12:43:34,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 292.22/254.84 [2019-03-28 12:43:34,829 INFO L87 Difference]: Start difference. First operand 27 states and 55 transitions. Second operand 3 states. 292.22/254.84 [2019-03-28 12:43:34,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 292.22/254.84 [2019-03-28 12:43:34,916 INFO L93 Difference]: Finished difference Result 27 states and 55 transitions. 292.22/254.84 [2019-03-28 12:43:34,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 292.22/254.84 [2019-03-28 12:43:34,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 292.22/254.84 [2019-03-28 12:43:34,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 292.22/254.84 [2019-03-28 12:43:34,919 INFO L225 Difference]: With dead ends: 27 292.22/254.84 [2019-03-28 12:43:34,919 INFO L226 Difference]: Without dead ends: 26 292.22/254.84 [2019-03-28 12:43:34,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 292.22/254.84 [2019-03-28 12:43:34,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 292.22/254.84 [2019-03-28 12:43:34,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. 292.22/254.84 [2019-03-28 12:43:34,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 292.22/254.84 [2019-03-28 12:43:34,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 54 transitions. 292.22/254.84 [2019-03-28 12:43:34,924 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 54 transitions. Word has length 6 292.22/254.84 [2019-03-28 12:43:34,924 INFO L84 Accepts]: Finished accepts. word is rejected. 292.22/254.84 [2019-03-28 12:43:34,924 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 54 transitions. 292.22/254.84 [2019-03-28 12:43:34,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 292.22/254.84 [2019-03-28 12:43:34,924 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 54 transitions. 292.22/254.84 [2019-03-28 12:43:34,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 292.22/254.84 [2019-03-28 12:43:34,925 INFO L394 BasicCegarLoop]: Found error trace 292.22/254.84 [2019-03-28 12:43:34,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 292.22/254.84 [2019-03-28 12:43:34,925 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 292.22/254.84 [2019-03-28 12:43:34,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.84 [2019-03-28 12:43:34,926 INFO L82 PathProgramCache]: Analyzing trace with hash -705163977, now seen corresponding path program 1 times 292.22/254.84 [2019-03-28 12:43:34,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.84 [2019-03-28 12:43:34,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.84 [2019-03-28 12:43:34,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:34,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:34,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.84 [2019-03-28 12:43:34,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.84 [2019-03-28 12:43:34,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 292.22/254.84 [2019-03-28 12:43:34,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 292.22/254.84 [2019-03-28 12:43:34,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 292.22/254.84 [2019-03-28 12:43:34,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 292.22/254.84 [2019-03-28 12:43:34,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 292.22/254.84 [2019-03-28 12:43:34,964 INFO L87 Difference]: Start difference. First operand 26 states and 54 transitions. Second operand 4 states. 292.22/254.84 [2019-03-28 12:43:35,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 292.22/254.84 [2019-03-28 12:43:35,052 INFO L93 Difference]: Finished difference Result 26 states and 54 transitions. 292.22/254.84 [2019-03-28 12:43:35,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 292.22/254.84 [2019-03-28 12:43:35,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 292.22/254.84 [2019-03-28 12:43:35,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 292.22/254.84 [2019-03-28 12:43:35,053 INFO L225 Difference]: With dead ends: 26 292.22/254.84 [2019-03-28 12:43:35,053 INFO L226 Difference]: Without dead ends: 24 292.22/254.84 [2019-03-28 12:43:35,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 292.22/254.84 [2019-03-28 12:43:35,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. 292.22/254.84 [2019-03-28 12:43:35,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. 292.22/254.84 [2019-03-28 12:43:35,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 292.22/254.84 [2019-03-28 12:43:35,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 50 transitions. 292.22/254.84 [2019-03-28 12:43:35,058 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 50 transitions. Word has length 7 292.22/254.84 [2019-03-28 12:43:35,058 INFO L84 Accepts]: Finished accepts. word is rejected. 292.22/254.84 [2019-03-28 12:43:35,059 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 50 transitions. 292.22/254.84 [2019-03-28 12:43:35,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 292.22/254.84 [2019-03-28 12:43:35,059 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 50 transitions. 292.22/254.84 [2019-03-28 12:43:35,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 292.22/254.84 [2019-03-28 12:43:35,059 INFO L394 BasicCegarLoop]: Found error trace 292.22/254.84 [2019-03-28 12:43:35,059 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 292.22/254.84 [2019-03-28 12:43:35,059 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 292.22/254.84 [2019-03-28 12:43:35,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.84 [2019-03-28 12:43:35,060 INFO L82 PathProgramCache]: Analyzing trace with hash -705163975, now seen corresponding path program 1 times 292.22/254.84 [2019-03-28 12:43:35,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.84 [2019-03-28 12:43:35,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.84 [2019-03-28 12:43:35,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:35,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:35,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.84 [2019-03-28 12:43:35,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.84 [2019-03-28 12:43:35,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 292.22/254.84 [2019-03-28 12:43:35,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 292.22/254.84 [2019-03-28 12:43:35,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 292.22/254.84 [2019-03-28 12:43:35,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 292.22/254.84 [2019-03-28 12:43:35,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 292.22/254.84 [2019-03-28 12:43:35,127 INFO L87 Difference]: Start difference. First operand 24 states and 50 transitions. Second operand 6 states. 292.22/254.84 [2019-03-28 12:43:35,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 292.22/254.84 [2019-03-28 12:43:35,282 INFO L93 Difference]: Finished difference Result 42 states and 89 transitions. 292.22/254.84 [2019-03-28 12:43:35,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 292.22/254.84 [2019-03-28 12:43:35,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 292.22/254.84 [2019-03-28 12:43:35,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 292.22/254.84 [2019-03-28 12:43:35,283 INFO L225 Difference]: With dead ends: 42 292.22/254.84 [2019-03-28 12:43:35,283 INFO L226 Difference]: Without dead ends: 40 292.22/254.84 [2019-03-28 12:43:35,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 292.22/254.84 [2019-03-28 12:43:35,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. 292.22/254.84 [2019-03-28 12:43:35,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. 292.22/254.84 [2019-03-28 12:43:35,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 292.22/254.84 [2019-03-28 12:43:35,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 54 transitions. 292.22/254.84 [2019-03-28 12:43:35,289 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 54 transitions. Word has length 7 292.22/254.84 [2019-03-28 12:43:35,290 INFO L84 Accepts]: Finished accepts. word is rejected. 292.22/254.84 [2019-03-28 12:43:35,290 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 54 transitions. 292.22/254.84 [2019-03-28 12:43:35,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 292.22/254.84 [2019-03-28 12:43:35,290 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 54 transitions. 292.22/254.84 [2019-03-28 12:43:35,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 292.22/254.84 [2019-03-28 12:43:35,290 INFO L394 BasicCegarLoop]: Found error trace 292.22/254.84 [2019-03-28 12:43:35,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 292.22/254.84 [2019-03-28 12:43:35,291 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 292.22/254.84 [2019-03-28 12:43:35,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.84 [2019-03-28 12:43:35,291 INFO L82 PathProgramCache]: Analyzing trace with hash -856108097, now seen corresponding path program 1 times 292.22/254.84 [2019-03-28 12:43:35,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.84 [2019-03-28 12:43:35,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.84 [2019-03-28 12:43:35,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:35,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:35,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.84 [2019-03-28 12:43:35,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.84 [2019-03-28 12:43:35,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 292.22/254.84 [2019-03-28 12:43:35,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 292.22/254.84 [2019-03-28 12:43:35,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 292.22/254.84 [2019-03-28 12:43:35,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 292.22/254.84 [2019-03-28 12:43:35,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 292.22/254.84 [2019-03-28 12:43:35,331 INFO L87 Difference]: Start difference. First operand 27 states and 54 transitions. Second operand 5 states. 292.22/254.84 [2019-03-28 12:43:35,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 292.22/254.84 [2019-03-28 12:43:35,442 INFO L93 Difference]: Finished difference Result 46 states and 90 transitions. 292.22/254.84 [2019-03-28 12:43:35,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 292.22/254.84 [2019-03-28 12:43:35,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 292.22/254.84 [2019-03-28 12:43:35,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 292.22/254.84 [2019-03-28 12:43:35,444 INFO L225 Difference]: With dead ends: 46 292.22/254.84 [2019-03-28 12:43:35,444 INFO L226 Difference]: Without dead ends: 43 292.22/254.84 [2019-03-28 12:43:35,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 292.22/254.84 [2019-03-28 12:43:35,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. 292.22/254.84 [2019-03-28 12:43:35,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. 292.22/254.84 [2019-03-28 12:43:35,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 292.22/254.84 [2019-03-28 12:43:35,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 82 transitions. 292.22/254.84 [2019-03-28 12:43:35,450 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 82 transitions. Word has length 10 292.22/254.84 [2019-03-28 12:43:35,450 INFO L84 Accepts]: Finished accepts. word is rejected. 292.22/254.84 [2019-03-28 12:43:35,450 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 82 transitions. 292.22/254.84 [2019-03-28 12:43:35,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 292.22/254.84 [2019-03-28 12:43:35,451 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 82 transitions. 292.22/254.84 [2019-03-28 12:43:35,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 292.22/254.84 [2019-03-28 12:43:35,451 INFO L394 BasicCegarLoop]: Found error trace 292.22/254.84 [2019-03-28 12:43:35,451 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 292.22/254.84 [2019-03-28 12:43:35,452 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 292.22/254.84 [2019-03-28 12:43:35,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.84 [2019-03-28 12:43:35,452 INFO L82 PathProgramCache]: Analyzing trace with hash -856108100, now seen corresponding path program 1 times 292.22/254.84 [2019-03-28 12:43:35,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.84 [2019-03-28 12:43:35,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.84 [2019-03-28 12:43:35,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:35,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:35,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.84 [2019-03-28 12:43:35,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.84 [2019-03-28 12:43:35,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 292.22/254.84 [2019-03-28 12:43:35,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 292.22/254.84 [2019-03-28 12:43:35,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 292.22/254.84 [2019-03-28 12:43:35,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 292.22/254.84 [2019-03-28 12:43:35,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 292.22/254.84 [2019-03-28 12:43:35,533 INFO L87 Difference]: Start difference. First operand 34 states and 82 transitions. Second operand 5 states. 292.22/254.84 [2019-03-28 12:43:35,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 292.22/254.84 [2019-03-28 12:43:35,629 INFO L93 Difference]: Finished difference Result 34 states and 82 transitions. 292.22/254.84 [2019-03-28 12:43:35,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 292.22/254.84 [2019-03-28 12:43:35,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 292.22/254.84 [2019-03-28 12:43:35,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 292.22/254.84 [2019-03-28 12:43:35,630 INFO L225 Difference]: With dead ends: 34 292.22/254.84 [2019-03-28 12:43:35,630 INFO L226 Difference]: Without dead ends: 31 292.22/254.84 [2019-03-28 12:43:35,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 292.22/254.84 [2019-03-28 12:43:35,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 292.22/254.84 [2019-03-28 12:43:35,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. 292.22/254.84 [2019-03-28 12:43:35,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 292.22/254.84 [2019-03-28 12:43:35,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 70 transitions. 292.22/254.84 [2019-03-28 12:43:35,636 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 70 transitions. Word has length 10 292.22/254.84 [2019-03-28 12:43:35,636 INFO L84 Accepts]: Finished accepts. word is rejected. 292.22/254.84 [2019-03-28 12:43:35,636 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 70 transitions. 292.22/254.84 [2019-03-28 12:43:35,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 292.22/254.84 [2019-03-28 12:43:35,637 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 70 transitions. 292.22/254.84 [2019-03-28 12:43:35,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 292.22/254.84 [2019-03-28 12:43:35,637 INFO L394 BasicCegarLoop]: Found error trace 292.22/254.84 [2019-03-28 12:43:35,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 292.22/254.84 [2019-03-28 12:43:35,637 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 292.22/254.84 [2019-03-28 12:43:35,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.84 [2019-03-28 12:43:35,638 INFO L82 PathProgramCache]: Analyzing trace with hash -856108098, now seen corresponding path program 1 times 292.22/254.84 [2019-03-28 12:43:35,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.84 [2019-03-28 12:43:35,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.84 [2019-03-28 12:43:35,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:35,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:35,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.84 [2019-03-28 12:43:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.84 [2019-03-28 12:43:35,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 292.22/254.84 [2019-03-28 12:43:35,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 292.22/254.84 [2019-03-28 12:43:35,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 292.22/254.84 [2019-03-28 12:43:35,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 292.22/254.84 [2019-03-28 12:43:35,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 292.22/254.84 [2019-03-28 12:43:35,713 INFO L87 Difference]: Start difference. First operand 31 states and 70 transitions. Second operand 6 states. 292.22/254.84 [2019-03-28 12:43:35,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 292.22/254.84 [2019-03-28 12:43:35,853 INFO L93 Difference]: Finished difference Result 37 states and 75 transitions. 292.22/254.84 [2019-03-28 12:43:35,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 292.22/254.84 [2019-03-28 12:43:35,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 292.22/254.84 [2019-03-28 12:43:35,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 292.22/254.84 [2019-03-28 12:43:35,854 INFO L225 Difference]: With dead ends: 37 292.22/254.84 [2019-03-28 12:43:35,854 INFO L226 Difference]: Without dead ends: 34 292.22/254.84 [2019-03-28 12:43:35,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 292.22/254.84 [2019-03-28 12:43:35,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. 292.22/254.84 [2019-03-28 12:43:35,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. 292.22/254.84 [2019-03-28 12:43:35,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 292.22/254.84 [2019-03-28 12:43:35,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 67 transitions. 292.22/254.84 [2019-03-28 12:43:35,860 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 67 transitions. Word has length 10 292.22/254.84 [2019-03-28 12:43:35,860 INFO L84 Accepts]: Finished accepts. word is rejected. 292.22/254.84 [2019-03-28 12:43:35,860 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 67 transitions. 292.22/254.84 [2019-03-28 12:43:35,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 292.22/254.84 [2019-03-28 12:43:35,860 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 67 transitions. 292.22/254.84 [2019-03-28 12:43:35,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 292.22/254.84 [2019-03-28 12:43:35,861 INFO L394 BasicCegarLoop]: Found error trace 292.22/254.84 [2019-03-28 12:43:35,861 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 292.22/254.84 [2019-03-28 12:43:35,861 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 292.22/254.84 [2019-03-28 12:43:35,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.84 [2019-03-28 12:43:35,862 INFO L82 PathProgramCache]: Analyzing trace with hash 889158909, now seen corresponding path program 1 times 292.22/254.84 [2019-03-28 12:43:35,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.84 [2019-03-28 12:43:35,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.84 [2019-03-28 12:43:35,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:35,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:35,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.84 [2019-03-28 12:43:35,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.84 [2019-03-28 12:43:35,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 292.22/254.84 [2019-03-28 12:43:35,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 292.22/254.84 [2019-03-28 12:43:35,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 292.22/254.84 [2019-03-28 12:43:35,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 292.22/254.84 [2019-03-28 12:43:35,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 292.22/254.84 [2019-03-28 12:43:35,895 INFO L87 Difference]: Start difference. First operand 31 states and 67 transitions. Second operand 3 states. 292.22/254.84 [2019-03-28 12:43:35,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 292.22/254.84 [2019-03-28 12:43:35,966 INFO L93 Difference]: Finished difference Result 57 states and 127 transitions. 292.22/254.84 [2019-03-28 12:43:35,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 292.22/254.84 [2019-03-28 12:43:35,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 292.22/254.84 [2019-03-28 12:43:35,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 292.22/254.84 [2019-03-28 12:43:35,968 INFO L225 Difference]: With dead ends: 57 292.22/254.84 [2019-03-28 12:43:35,968 INFO L226 Difference]: Without dead ends: 35 292.22/254.84 [2019-03-28 12:43:35,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 292.22/254.84 [2019-03-28 12:43:35,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. 292.22/254.84 [2019-03-28 12:43:35,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. 292.22/254.84 [2019-03-28 12:43:35,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 292.22/254.84 [2019-03-28 12:43:35,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 70 transitions. 292.22/254.84 [2019-03-28 12:43:35,973 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 70 transitions. Word has length 14 292.22/254.84 [2019-03-28 12:43:35,973 INFO L84 Accepts]: Finished accepts. word is rejected. 292.22/254.84 [2019-03-28 12:43:35,973 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 70 transitions. 292.22/254.84 [2019-03-28 12:43:35,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 292.22/254.84 [2019-03-28 12:43:35,974 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 70 transitions. 292.22/254.84 [2019-03-28 12:43:35,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 292.22/254.84 [2019-03-28 12:43:35,974 INFO L394 BasicCegarLoop]: Found error trace 292.22/254.84 [2019-03-28 12:43:35,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 292.22/254.84 [2019-03-28 12:43:35,975 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 292.22/254.84 [2019-03-28 12:43:35,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.84 [2019-03-28 12:43:35,975 INFO L82 PathProgramCache]: Analyzing trace with hash 889218491, now seen corresponding path program 1 times 292.22/254.84 [2019-03-28 12:43:35,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.84 [2019-03-28 12:43:35,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.84 [2019-03-28 12:43:35,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:35,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:35,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.84 [2019-03-28 12:43:35,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.84 [2019-03-28 12:43:35,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 292.22/254.84 [2019-03-28 12:43:35,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 292.22/254.84 [2019-03-28 12:43:36,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 292.22/254.84 [2019-03-28 12:43:36,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 292.22/254.84 [2019-03-28 12:43:36,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 292.22/254.84 [2019-03-28 12:43:36,000 INFO L87 Difference]: Start difference. First operand 34 states and 70 transitions. Second operand 3 states. 292.22/254.84 [2019-03-28 12:43:36,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 292.22/254.84 [2019-03-28 12:43:36,056 INFO L93 Difference]: Finished difference Result 59 states and 125 transitions. 292.22/254.84 [2019-03-28 12:43:36,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 292.22/254.84 [2019-03-28 12:43:36,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 292.22/254.84 [2019-03-28 12:43:36,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 292.22/254.84 [2019-03-28 12:43:36,057 INFO L225 Difference]: With dead ends: 59 292.22/254.84 [2019-03-28 12:43:36,058 INFO L226 Difference]: Without dead ends: 34 292.22/254.84 [2019-03-28 12:43:36,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 292.22/254.84 [2019-03-28 12:43:36,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. 292.22/254.84 [2019-03-28 12:43:36,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. 292.22/254.84 [2019-03-28 12:43:36,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 292.22/254.84 [2019-03-28 12:43:36,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 66 transitions. 292.22/254.84 [2019-03-28 12:43:36,063 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 66 transitions. Word has length 14 292.22/254.84 [2019-03-28 12:43:36,063 INFO L84 Accepts]: Finished accepts. word is rejected. 292.22/254.84 [2019-03-28 12:43:36,063 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 66 transitions. 292.22/254.84 [2019-03-28 12:43:36,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 292.22/254.84 [2019-03-28 12:43:36,063 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 66 transitions. 292.22/254.84 [2019-03-28 12:43:36,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 292.22/254.84 [2019-03-28 12:43:36,064 INFO L394 BasicCegarLoop]: Found error trace 292.22/254.84 [2019-03-28 12:43:36,064 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 292.22/254.84 [2019-03-28 12:43:36,064 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 292.22/254.84 [2019-03-28 12:43:36,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.84 [2019-03-28 12:43:36,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1795969641, now seen corresponding path program 1 times 292.22/254.84 [2019-03-28 12:43:36,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.84 [2019-03-28 12:43:36,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.84 [2019-03-28 12:43:36,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:36,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:36,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.84 [2019-03-28 12:43:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.84 [2019-03-28 12:43:36,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 292.22/254.84 [2019-03-28 12:43:36,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 292.22/254.84 [2019-03-28 12:43:36,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 292.22/254.84 [2019-03-28 12:43:36,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 292.22/254.84 [2019-03-28 12:43:36,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 292.22/254.84 [2019-03-28 12:43:36,132 INFO L87 Difference]: Start difference. First operand 34 states and 66 transitions. Second operand 7 states. 292.22/254.84 [2019-03-28 12:43:36,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 292.22/254.84 [2019-03-28 12:43:36,306 INFO L93 Difference]: Finished difference Result 64 states and 123 transitions. 292.22/254.84 [2019-03-28 12:43:36,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 292.22/254.84 [2019-03-28 12:43:36,306 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 292.22/254.84 [2019-03-28 12:43:36,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 292.22/254.84 [2019-03-28 12:43:36,307 INFO L225 Difference]: With dead ends: 64 292.22/254.84 [2019-03-28 12:43:36,307 INFO L226 Difference]: Without dead ends: 36 292.22/254.84 [2019-03-28 12:43:36,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 292.22/254.84 [2019-03-28 12:43:36,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. 292.22/254.84 [2019-03-28 12:43:36,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. 292.22/254.84 [2019-03-28 12:43:36,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. 292.22/254.84 [2019-03-28 12:43:36,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 67 transitions. 292.22/254.84 [2019-03-28 12:43:36,312 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 67 transitions. Word has length 15 292.22/254.84 [2019-03-28 12:43:36,313 INFO L84 Accepts]: Finished accepts. word is rejected. 292.22/254.84 [2019-03-28 12:43:36,313 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 67 transitions. 292.22/254.84 [2019-03-28 12:43:36,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 292.22/254.84 [2019-03-28 12:43:36,313 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 67 transitions. 292.22/254.84 [2019-03-28 12:43:36,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 292.22/254.84 [2019-03-28 12:43:36,313 INFO L394 BasicCegarLoop]: Found error trace 292.22/254.84 [2019-03-28 12:43:36,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 292.22/254.84 [2019-03-28 12:43:36,314 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 292.22/254.84 [2019-03-28 12:43:36,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.84 [2019-03-28 12:43:36,314 INFO L82 PathProgramCache]: Analyzing trace with hash -218310711, now seen corresponding path program 1 times 292.22/254.84 [2019-03-28 12:43:36,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.84 [2019-03-28 12:43:36,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.84 [2019-03-28 12:43:36,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:36,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:36,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.84 [2019-03-28 12:43:36,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.84 [2019-03-28 12:43:36,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 292.22/254.84 [2019-03-28 12:43:36,367 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 292.22/254.84 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 292.22/254.84 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 292.22/254.84 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 292.22/254.84 [2019-03-28 12:43:36,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.84 [2019-03-28 12:43:36,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjunts are in the unsatisfiable core 292.22/254.84 [2019-03-28 12:43:36,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... 292.22/254.84 [2019-03-28 12:43:36,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.84 [2019-03-28 12:43:36,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 292.22/254.84 [2019-03-28 12:43:36,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 292.22/254.84 [2019-03-28 12:43:36,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 292.22/254.84 [2019-03-28 12:43:36,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 292.22/254.84 [2019-03-28 12:43:36,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 292.22/254.84 [2019-03-28 12:43:36,464 INFO L87 Difference]: Start difference. First operand 35 states and 67 transitions. Second operand 7 states. 292.22/254.84 [2019-03-28 12:43:36,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 292.22/254.84 [2019-03-28 12:43:36,623 INFO L93 Difference]: Finished difference Result 42 states and 73 transitions. 292.22/254.84 [2019-03-28 12:43:36,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 292.22/254.84 [2019-03-28 12:43:36,623 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 292.22/254.84 [2019-03-28 12:43:36,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 292.22/254.84 [2019-03-28 12:43:36,624 INFO L225 Difference]: With dead ends: 42 292.22/254.84 [2019-03-28 12:43:36,624 INFO L226 Difference]: Without dead ends: 39 292.22/254.84 [2019-03-28 12:43:36,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 292.22/254.84 [2019-03-28 12:43:36,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. 292.22/254.84 [2019-03-28 12:43:36,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. 292.22/254.84 [2019-03-28 12:43:36,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. 292.22/254.84 [2019-03-28 12:43:36,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 63 transitions. 292.22/254.84 [2019-03-28 12:43:36,629 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 63 transitions. Word has length 16 292.22/254.84 [2019-03-28 12:43:36,629 INFO L84 Accepts]: Finished accepts. word is rejected. 292.22/254.84 [2019-03-28 12:43:36,630 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 63 transitions. 292.22/254.84 [2019-03-28 12:43:36,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 292.22/254.84 [2019-03-28 12:43:36,630 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 63 transitions. 292.22/254.84 [2019-03-28 12:43:36,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 292.22/254.84 [2019-03-28 12:43:36,630 INFO L394 BasicCegarLoop]: Found error trace 292.22/254.84 [2019-03-28 12:43:36,631 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 292.22/254.84 [2019-03-28 12:43:36,631 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 292.22/254.84 [2019-03-28 12:43:36,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.84 [2019-03-28 12:43:36,631 INFO L82 PathProgramCache]: Analyzing trace with hash -218310712, now seen corresponding path program 1 times 292.22/254.84 [2019-03-28 12:43:36,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.84 [2019-03-28 12:43:36,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.84 [2019-03-28 12:43:36,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:36,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:36,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.84 [2019-03-28 12:43:36,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.84 [2019-03-28 12:43:36,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 292.22/254.84 [2019-03-28 12:43:36,825 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 292.22/254.84 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 292.22/254.84 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 292.22/254.84 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 292.22/254.84 [2019-03-28 12:43:36,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.84 [2019-03-28 12:43:36,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 20 conjunts are in the unsatisfiable core 292.22/254.84 [2019-03-28 12:43:36,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... 292.22/254.84 [2019-03-28 12:43:36,912 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 292.22/254.84 [2019-03-28 12:43:36,913 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 292.22/254.84 [2019-03-28 12:43:36,924 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 292.22/254.84 [2019-03-28 12:43:36,925 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 292.22/254.84 [2019-03-28 12:43:36,925 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 292.22/254.84 [2019-03-28 12:43:37,006 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 292.22/254.84 [2019-03-28 12:43:37,006 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 292.22/254.84 [2019-03-28 12:43:37,010 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 292.22/254.84 [2019-03-28 12:43:37,021 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 292.22/254.84 [2019-03-28 12:43:37,026 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 292.22/254.84 [2019-03-28 12:43:37,026 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 292.22/254.84 [2019-03-28 12:43:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.84 [2019-03-28 12:43:37,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 292.22/254.84 [2019-03-28 12:43:37,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 292.22/254.84 [2019-03-28 12:43:37,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states 292.22/254.84 [2019-03-28 12:43:37,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. 292.22/254.84 [2019-03-28 12:43:37,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 292.22/254.84 [2019-03-28 12:43:37,103 INFO L87 Difference]: Start difference. First operand 35 states and 63 transitions. Second operand 13 states. 292.22/254.84 [2019-03-28 12:43:38,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 292.22/254.84 [2019-03-28 12:43:38,403 INFO L93 Difference]: Finished difference Result 46 states and 85 transitions. 292.22/254.84 [2019-03-28 12:43:38,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 292.22/254.84 [2019-03-28 12:43:38,403 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 292.22/254.84 [2019-03-28 12:43:38,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 292.22/254.84 [2019-03-28 12:43:38,404 INFO L225 Difference]: With dead ends: 46 292.22/254.84 [2019-03-28 12:43:38,404 INFO L226 Difference]: Without dead ends: 40 292.22/254.84 [2019-03-28 12:43:38,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 292.22/254.84 [2019-03-28 12:43:38,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. 292.22/254.84 [2019-03-28 12:43:38,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 30. 292.22/254.84 [2019-03-28 12:43:38,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 292.22/254.84 [2019-03-28 12:43:38,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 57 transitions. 292.22/254.84 [2019-03-28 12:43:38,411 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 57 transitions. Word has length 16 292.22/254.84 [2019-03-28 12:43:38,412 INFO L84 Accepts]: Finished accepts. word is rejected. 292.22/254.84 [2019-03-28 12:43:38,412 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 57 transitions. 292.22/254.84 [2019-03-28 12:43:38,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. 292.22/254.84 [2019-03-28 12:43:38,412 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 57 transitions. 292.22/254.84 [2019-03-28 12:43:38,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 292.22/254.84 [2019-03-28 12:43:38,413 INFO L394 BasicCegarLoop]: Found error trace 292.22/254.84 [2019-03-28 12:43:38,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 292.22/254.84 [2019-03-28 12:43:38,413 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 292.22/254.84 [2019-03-28 12:43:38,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.84 [2019-03-28 12:43:38,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1822332538, now seen corresponding path program 1 times 292.22/254.84 [2019-03-28 12:43:38,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.84 [2019-03-28 12:43:38,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.84 [2019-03-28 12:43:38,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:38,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:38,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.84 [2019-03-28 12:43:38,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.84 [2019-03-28 12:43:38,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 292.22/254.84 [2019-03-28 12:43:38,621 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 292.22/254.84 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 292.22/254.84 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 292.22/254.84 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 292.22/254.84 [2019-03-28 12:43:38,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.84 [2019-03-28 12:43:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.84 [2019-03-28 12:43:38,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 25 conjunts are in the unsatisfiable core 292.22/254.84 [2019-03-28 12:43:38,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... 292.22/254.84 [2019-03-28 12:43:38,666 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 292.22/254.84 [2019-03-28 12:43:38,666 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 292.22/254.84 [2019-03-28 12:43:38,671 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 292.22/254.84 [2019-03-28 12:43:38,671 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 292.22/254.84 [2019-03-28 12:43:38,672 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 292.22/254.84 [2019-03-28 12:43:38,694 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 292.22/254.84 [2019-03-28 12:43:38,694 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 292.22/254.84 [2019-03-28 12:43:38,702 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 292.22/254.84 [2019-03-28 12:43:38,703 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 292.22/254.84 [2019-03-28 12:43:38,703 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 292.22/254.84 [2019-03-28 12:43:38,737 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 292.22/254.84 [2019-03-28 12:43:38,738 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 292.22/254.84 [2019-03-28 12:43:38,750 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 292.22/254.84 [2019-03-28 12:43:38,751 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. 292.22/254.84 [2019-03-28 12:43:38,752 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:42, output treesize:38 292.22/254.84 [2019-03-28 12:43:38,795 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 292.22/254.84 [2019-03-28 12:43:38,795 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 292.22/254.84 [2019-03-28 12:43:38,796 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 292.22/254.84 [2019-03-28 12:43:38,808 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 292.22/254.84 [2019-03-28 12:43:38,811 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 292.22/254.84 [2019-03-28 12:43:38,812 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:27 292.22/254.84 [2019-03-28 12:43:38,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.84 [2019-03-28 12:43:38,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 292.22/254.84 [2019-03-28 12:43:38,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 292.22/254.84 [2019-03-28 12:43:38,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states 292.22/254.84 [2019-03-28 12:43:38,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. 292.22/254.84 [2019-03-28 12:43:38,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 292.22/254.84 [2019-03-28 12:43:38,897 INFO L87 Difference]: Start difference. First operand 30 states and 57 transitions. Second operand 15 states. 292.22/254.84 [2019-03-28 12:43:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 292.22/254.84 [2019-03-28 12:43:40,045 INFO L93 Difference]: Finished difference Result 67 states and 129 transitions. 292.22/254.85 [2019-03-28 12:43:40,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 292.22/254.85 [2019-03-28 12:43:40,046 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 292.22/254.85 [2019-03-28 12:43:40,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 292.22/254.85 [2019-03-28 12:43:40,047 INFO L225 Difference]: With dead ends: 67 292.22/254.85 [2019-03-28 12:43:40,047 INFO L226 Difference]: Without dead ends: 65 292.22/254.85 [2019-03-28 12:43:40,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=207, Invalid=443, Unknown=0, NotChecked=0, Total=650 292.22/254.85 [2019-03-28 12:43:40,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. 292.22/254.85 [2019-03-28 12:43:40,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 46. 292.22/254.85 [2019-03-28 12:43:40,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. 292.22/254.85 [2019-03-28 12:43:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 92 transitions. 292.22/254.85 [2019-03-28 12:43:40,057 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 92 transitions. Word has length 17 292.22/254.85 [2019-03-28 12:43:40,057 INFO L84 Accepts]: Finished accepts. word is rejected. 292.22/254.85 [2019-03-28 12:43:40,058 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 92 transitions. 292.22/254.85 [2019-03-28 12:43:40,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. 292.22/254.85 [2019-03-28 12:43:40,058 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 92 transitions. 292.22/254.85 [2019-03-28 12:43:40,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 292.22/254.85 [2019-03-28 12:43:40,058 INFO L394 BasicCegarLoop]: Found error trace 292.22/254.85 [2019-03-28 12:43:40,059 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 292.22/254.85 [2019-03-28 12:43:40,059 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 292.22/254.85 [2019-03-28 12:43:40,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.85 [2019-03-28 12:43:40,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1822332539, now seen corresponding path program 1 times 292.22/254.85 [2019-03-28 12:43:40,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.85 [2019-03-28 12:43:40,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.85 [2019-03-28 12:43:40,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:43:40,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:43:40,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:43:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.85 [2019-03-28 12:43:40,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.85 [2019-03-28 12:43:40,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 292.22/254.85 [2019-03-28 12:43:40,105 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 292.22/254.85 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 292.22/254.85 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 292.22/254.85 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 292.22/254.85 [2019-03-28 12:43:40,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:43:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.85 [2019-03-28 12:43:40,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core 292.22/254.85 [2019-03-28 12:43:40,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... 292.22/254.85 [2019-03-28 12:43:40,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.85 [2019-03-28 12:43:40,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 292.22/254.85 [2019-03-28 12:43:40,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 292.22/254.85 [2019-03-28 12:43:40,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 292.22/254.85 [2019-03-28 12:43:40,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 292.22/254.85 [2019-03-28 12:43:40,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 292.22/254.85 [2019-03-28 12:43:40,176 INFO L87 Difference]: Start difference. First operand 46 states and 92 transitions. Second operand 6 states. 292.22/254.85 [2019-03-28 12:43:40,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 292.22/254.85 [2019-03-28 12:43:40,300 INFO L93 Difference]: Finished difference Result 48 states and 92 transitions. 292.22/254.85 [2019-03-28 12:43:40,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 292.22/254.85 [2019-03-28 12:43:40,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 292.22/254.85 [2019-03-28 12:43:40,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 292.22/254.85 [2019-03-28 12:43:40,301 INFO L225 Difference]: With dead ends: 48 292.22/254.85 [2019-03-28 12:43:40,301 INFO L226 Difference]: Without dead ends: 46 292.22/254.85 [2019-03-28 12:43:40,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 292.22/254.85 [2019-03-28 12:43:40,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. 292.22/254.85 [2019-03-28 12:43:40,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. 292.22/254.85 [2019-03-28 12:43:40,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. 292.22/254.85 [2019-03-28 12:43:40,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 89 transitions. 292.22/254.85 [2019-03-28 12:43:40,310 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 89 transitions. Word has length 17 292.22/254.85 [2019-03-28 12:43:40,310 INFO L84 Accepts]: Finished accepts. word is rejected. 292.22/254.85 [2019-03-28 12:43:40,310 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 89 transitions. 292.22/254.85 [2019-03-28 12:43:40,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 292.22/254.85 [2019-03-28 12:43:40,311 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 89 transitions. 292.22/254.85 [2019-03-28 12:43:40,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 292.22/254.85 [2019-03-28 12:43:40,311 INFO L394 BasicCegarLoop]: Found error trace 292.22/254.85 [2019-03-28 12:43:40,312 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 292.22/254.85 [2019-03-28 12:43:40,312 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 292.22/254.85 [2019-03-28 12:43:40,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.85 [2019-03-28 12:43:40,312 INFO L82 PathProgramCache]: Analyzing trace with hash 804006994, now seen corresponding path program 2 times 292.22/254.85 [2019-03-28 12:43:40,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.85 [2019-03-28 12:43:40,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.85 [2019-03-28 12:43:40,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:43:40,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:43:40,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:43:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.85 [2019-03-28 12:43:40,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.85 [2019-03-28 12:43:40,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 292.22/254.85 [2019-03-28 12:43:40,576 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 292.22/254.85 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 292.22/254.85 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 292.22/254.85 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 292.22/254.85 [2019-03-28 12:43:40,587 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 292.22/254.85 [2019-03-28 12:43:40,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 292.22/254.85 [2019-03-28 12:43:40,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 292.22/254.85 [2019-03-28 12:43:40,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 22 conjunts are in the unsatisfiable core 292.22/254.85 [2019-03-28 12:43:40,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... 292.22/254.85 [2019-03-28 12:43:40,627 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 292.22/254.85 [2019-03-28 12:43:40,628 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 292.22/254.85 [2019-03-28 12:43:40,628 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 292.22/254.85 [2019-03-28 12:43:40,643 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size 292.22/254.85 [2019-03-28 12:43:40,643 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 292.22/254.85 [2019-03-28 12:43:40,644 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 292.22/254.85 [2019-03-28 12:43:40,659 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 292.22/254.85 [2019-03-28 12:43:40,660 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 292.22/254.85 [2019-03-28 12:43:40,665 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 292.22/254.85 [2019-03-28 12:43:40,666 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 292.22/254.85 [2019-03-28 12:43:40,666 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 292.22/254.85 [2019-03-28 12:43:40,722 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 292.22/254.85 [2019-03-28 12:43:40,722 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 292.22/254.85 [2019-03-28 12:43:40,723 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 292.22/254.85 [2019-03-28 12:43:40,731 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 292.22/254.85 [2019-03-28 12:43:40,733 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 292.22/254.85 [2019-03-28 12:43:40,733 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 292.22/254.85 [2019-03-28 12:43:40,795 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 292.22/254.85 [2019-03-28 12:43:40,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 292.22/254.85 [2019-03-28 12:43:40,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 292.22/254.85 [2019-03-28 12:43:40,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states 292.22/254.85 [2019-03-28 12:43:40,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. 292.22/254.85 [2019-03-28 12:43:40,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 292.22/254.85 [2019-03-28 12:43:40,823 INFO L87 Difference]: Start difference. First operand 45 states and 89 transitions. Second operand 15 states. 292.22/254.85 [2019-03-28 12:43:41,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 292.22/254.85 [2019-03-28 12:43:41,993 INFO L93 Difference]: Finished difference Result 108 states and 207 transitions. 292.22/254.85 [2019-03-28 12:43:41,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 292.22/254.85 [2019-03-28 12:43:41,995 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 292.22/254.85 [2019-03-28 12:43:41,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 292.22/254.85 [2019-03-28 12:43:41,997 INFO L225 Difference]: With dead ends: 108 292.22/254.85 [2019-03-28 12:43:41,997 INFO L226 Difference]: Without dead ends: 107 292.22/254.85 [2019-03-28 12:43:41,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=266, Invalid=664, Unknown=0, NotChecked=0, Total=930 292.22/254.85 [2019-03-28 12:43:41,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. 292.22/254.85 [2019-03-28 12:43:42,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 57. 292.22/254.85 [2019-03-28 12:43:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. 292.22/254.85 [2019-03-28 12:43:42,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 119 transitions. 292.22/254.85 [2019-03-28 12:43:42,008 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 119 transitions. Word has length 22 292.22/254.85 [2019-03-28 12:43:42,009 INFO L84 Accepts]: Finished accepts. word is rejected. 292.22/254.85 [2019-03-28 12:43:42,009 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 119 transitions. 292.22/254.85 [2019-03-28 12:43:42,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. 292.22/254.85 [2019-03-28 12:43:42,009 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 119 transitions. 292.22/254.85 [2019-03-28 12:43:42,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 292.22/254.85 [2019-03-28 12:43:42,010 INFO L394 BasicCegarLoop]: Found error trace 292.22/254.85 [2019-03-28 12:43:42,010 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] 292.22/254.85 [2019-03-28 12:43:42,010 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 292.22/254.85 [2019-03-28 12:43:42,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.85 [2019-03-28 12:43:42,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1652604293, now seen corresponding path program 2 times 292.22/254.85 [2019-03-28 12:43:42,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.85 [2019-03-28 12:43:42,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.85 [2019-03-28 12:43:42,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:43:42,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:43:42,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:43:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.85 [2019-03-28 12:43:42,335 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.85 [2019-03-28 12:43:42,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 292.22/254.85 [2019-03-28 12:43:42,335 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 292.22/254.85 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 292.22/254.85 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 292.22/254.85 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 292.22/254.85 [2019-03-28 12:43:42,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 292.22/254.85 [2019-03-28 12:43:42,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 292.22/254.85 [2019-03-28 12:43:42,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 292.22/254.85 [2019-03-28 12:43:42,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 63 conjunts are in the unsatisfiable core 292.22/254.85 [2019-03-28 12:43:42,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... 292.22/254.85 [2019-03-28 12:43:42,398 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 292.22/254.85 [2019-03-28 12:43:42,398 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 292.22/254.85 [2019-03-28 12:43:42,403 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 292.22/254.85 [2019-03-28 12:43:42,403 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 292.22/254.85 [2019-03-28 12:43:42,404 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 292.22/254.85 [2019-03-28 12:43:42,426 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 292.22/254.85 [2019-03-28 12:43:42,427 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 292.22/254.85 [2019-03-28 12:43:42,436 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 292.22/254.85 [2019-03-28 12:43:42,437 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 292.22/254.85 [2019-03-28 12:43:42,437 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 292.22/254.85 [2019-03-28 12:43:42,473 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 292.22/254.85 [2019-03-28 12:43:42,473 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 292.22/254.85 [2019-03-28 12:43:42,487 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 292.22/254.85 [2019-03-28 12:43:42,488 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 292.22/254.85 [2019-03-28 12:43:42,489 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:40 292.22/254.85 [2019-03-28 12:43:42,911 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 292.22/254.85 [2019-03-28 12:43:42,912 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 56 292.22/254.85 [2019-03-28 12:43:42,916 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 292.22/254.85 [2019-03-28 12:43:42,933 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 292.22/254.85 [2019-03-28 12:43:42,935 INFO L427 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 292.22/254.85 [2019-03-28 12:43:42,935 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:76, output treesize:20 292.22/254.85 [2019-03-28 12:43:42,956 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.85 [2019-03-28 12:43:42,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 292.22/254.85 [2019-03-28 12:43:42,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 292.22/254.85 [2019-03-28 12:43:42,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states 292.22/254.85 [2019-03-28 12:43:42,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. 292.22/254.85 [2019-03-28 12:43:42,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 292.22/254.85 [2019-03-28 12:43:42,984 INFO L87 Difference]: Start difference. First operand 57 states and 119 transitions. Second operand 21 states. 292.22/254.85 [2019-03-28 12:43:43,416 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 292.22/254.85 [2019-03-28 12:43:43,583 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 72 292.22/254.85 [2019-03-28 12:43:44,013 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 77 292.22/254.85 [2019-03-28 12:43:44,358 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 292.22/254.85 [2019-03-28 12:43:44,533 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 85 292.22/254.85 [2019-03-28 12:43:45,684 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 292.22/254.85 [2019-03-28 12:43:46,936 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 78 292.22/254.85 [2019-03-28 12:43:48,877 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 87 292.22/254.85 [2019-03-28 12:43:52,140 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 82 292.22/254.85 [2019-03-28 12:43:53,102 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 84 292.22/254.85 [2019-03-28 12:43:53,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 292.22/254.85 [2019-03-28 12:43:53,301 INFO L93 Difference]: Finished difference Result 184 states and 377 transitions. 292.22/254.85 [2019-03-28 12:43:53,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 292.22/254.85 [2019-03-28 12:43:53,302 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 292.22/254.85 [2019-03-28 12:43:53,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 292.22/254.85 [2019-03-28 12:43:53,303 INFO L225 Difference]: With dead ends: 184 292.22/254.85 [2019-03-28 12:43:53,304 INFO L226 Difference]: Without dead ends: 183 292.22/254.85 [2019-03-28 12:43:53,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=483, Invalid=1679, Unknown=0, NotChecked=0, Total=2162 292.22/254.85 [2019-03-28 12:43:53,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. 292.22/254.85 [2019-03-28 12:43:53,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 111. 292.22/254.85 [2019-03-28 12:43:53,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. 292.22/254.85 [2019-03-28 12:43:53,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 233 transitions. 292.22/254.85 [2019-03-28 12:43:53,326 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 233 transitions. Word has length 27 292.22/254.85 [2019-03-28 12:43:53,326 INFO L84 Accepts]: Finished accepts. word is rejected. 292.22/254.85 [2019-03-28 12:43:53,326 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 233 transitions. 292.22/254.85 [2019-03-28 12:43:53,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. 292.22/254.85 [2019-03-28 12:43:53,327 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 233 transitions. 292.22/254.85 [2019-03-28 12:43:53,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 292.22/254.85 [2019-03-28 12:43:53,328 INFO L394 BasicCegarLoop]: Found error trace 292.22/254.85 [2019-03-28 12:43:53,328 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 292.22/254.85 [2019-03-28 12:43:53,328 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 292.22/254.85 [2019-03-28 12:43:53,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.85 [2019-03-28 12:43:53,328 INFO L82 PathProgramCache]: Analyzing trace with hash -824358405, now seen corresponding path program 1 times 292.22/254.85 [2019-03-28 12:43:53,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.85 [2019-03-28 12:43:53,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.85 [2019-03-28 12:43:53,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:43:53,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:43:53,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:43:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.85 [2019-03-28 12:43:53,504 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. 292.22/254.85 [2019-03-28 12:43:53,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 292.22/254.85 [2019-03-28 12:43:53,505 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 292.22/254.85 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 292.22/254.85 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 292.22/254.85 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 292.22/254.85 [2019-03-28 12:43:53,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:43:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.85 [2019-03-28 12:43:53,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 25 conjunts are in the unsatisfiable core 292.22/254.85 [2019-03-28 12:43:53,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... 292.22/254.85 [2019-03-28 12:43:53,563 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 292.22/254.85 [2019-03-28 12:43:53,563 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 292.22/254.85 [2019-03-28 12:43:53,564 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 292.22/254.85 [2019-03-28 12:43:53,578 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size 292.22/254.85 [2019-03-28 12:43:53,579 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 292.22/254.85 [2019-03-28 12:43:53,579 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 292.22/254.85 [2019-03-28 12:43:53,583 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 292.22/254.85 [2019-03-28 12:43:53,583 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 292.22/254.85 [2019-03-28 12:43:53,585 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 292.22/254.85 [2019-03-28 12:43:53,585 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 292.22/254.85 [2019-03-28 12:43:53,585 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 292.22/254.85 [2019-03-28 12:43:53,595 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 292.22/254.85 [2019-03-28 12:43:53,596 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 292.22/254.85 [2019-03-28 12:43:53,596 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 292.22/254.85 [2019-03-28 12:43:53,603 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 292.22/254.85 [2019-03-28 12:43:53,603 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 292.22/254.85 [2019-03-28 12:43:53,604 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 292.22/254.85 [2019-03-28 12:43:53,630 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. 292.22/254.85 [2019-03-28 12:43:53,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 292.22/254.85 [2019-03-28 12:43:53,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 292.22/254.85 [2019-03-28 12:43:53,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states 292.22/254.85 [2019-03-28 12:43:53,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. 292.22/254.85 [2019-03-28 12:43:53,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 292.22/254.85 [2019-03-28 12:43:53,658 INFO L87 Difference]: Start difference. First operand 111 states and 233 transitions. Second operand 10 states. 292.22/254.85 [2019-03-28 12:43:53,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 292.22/254.85 [2019-03-28 12:43:53,873 INFO L93 Difference]: Finished difference Result 111 states and 233 transitions. 292.22/254.85 [2019-03-28 12:43:53,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 292.22/254.85 [2019-03-28 12:43:53,874 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 292.22/254.85 [2019-03-28 12:43:53,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 292.22/254.85 [2019-03-28 12:43:53,875 INFO L225 Difference]: With dead ends: 111 292.22/254.85 [2019-03-28 12:43:53,875 INFO L226 Difference]: Without dead ends: 110 292.22/254.85 [2019-03-28 12:43:53,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 292.22/254.85 [2019-03-28 12:43:53,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. 292.22/254.85 [2019-03-28 12:43:53,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 76. 292.22/254.85 [2019-03-28 12:43:53,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. 292.22/254.85 [2019-03-28 12:43:53,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 151 transitions. 292.22/254.85 [2019-03-28 12:43:53,889 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 151 transitions. Word has length 28 292.22/254.85 [2019-03-28 12:43:53,890 INFO L84 Accepts]: Finished accepts. word is rejected. 292.22/254.85 [2019-03-28 12:43:53,890 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 151 transitions. 292.22/254.85 [2019-03-28 12:43:53,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. 292.22/254.85 [2019-03-28 12:43:53,890 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 151 transitions. 292.22/254.85 [2019-03-28 12:43:53,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 292.22/254.85 [2019-03-28 12:43:53,891 INFO L394 BasicCegarLoop]: Found error trace 292.22/254.85 [2019-03-28 12:43:53,891 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] 292.22/254.85 [2019-03-28 12:43:53,891 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 292.22/254.85 [2019-03-28 12:43:53,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.85 [2019-03-28 12:43:53,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1935515964, now seen corresponding path program 3 times 292.22/254.85 [2019-03-28 12:43:53,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.85 [2019-03-28 12:43:53,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.85 [2019-03-28 12:43:53,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:43:53,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:43:53,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:43:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.85 [2019-03-28 12:43:54,074 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. 292.22/254.85 [2019-03-28 12:43:54,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 292.22/254.85 [2019-03-28 12:43:54,074 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 292.22/254.85 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 292.22/254.85 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 292.22/254.85 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 292.22/254.85 [2019-03-28 12:43:54,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 292.22/254.85 [2019-03-28 12:43:54,129 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) 292.22/254.85 [2019-03-28 12:43:54,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 292.22/254.85 [2019-03-28 12:43:54,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 53 conjunts are in the unsatisfiable core 292.22/254.85 [2019-03-28 12:43:54,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... 292.22/254.85 [2019-03-28 12:43:54,145 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 292.22/254.85 [2019-03-28 12:43:54,145 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 292.22/254.85 [2019-03-28 12:43:54,157 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 292.22/254.85 [2019-03-28 12:43:54,161 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 292.22/254.85 [2019-03-28 12:43:54,161 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 292.22/254.85 [2019-03-28 12:43:54,170 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 292.22/254.85 [2019-03-28 12:43:54,170 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. 292.22/254.85 [2019-03-28 12:43:54,171 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 292.22/254.85 [2019-03-28 12:43:54,196 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 292.22/254.85 [2019-03-28 12:43:54,196 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 292.22/254.85 [2019-03-28 12:43:54,207 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 292.22/254.85 [2019-03-28 12:43:54,208 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 292.22/254.85 [2019-03-28 12:43:54,208 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 292.22/254.85 [2019-03-28 12:43:54,243 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 292.22/254.85 [2019-03-28 12:43:54,243 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 292.22/254.85 [2019-03-28 12:43:54,257 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 292.22/254.85 [2019-03-28 12:43:54,257 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 292.22/254.85 [2019-03-28 12:43:54,258 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 292.22/254.85 [2019-03-28 12:43:54,655 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 292.22/254.85 [2019-03-28 12:43:54,656 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 62 292.22/254.85 [2019-03-28 12:43:54,680 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 292.22/254.85 [2019-03-28 12:43:54,727 INFO L497 ElimStorePlain]: treesize reduction 32, result has 61.0 percent of original size 292.22/254.85 [2019-03-28 12:43:54,729 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 292.22/254.85 [2019-03-28 12:43:54,730 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:75, output treesize:25 292.22/254.85 [2019-03-28 12:43:54,789 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 292.22/254.85 [2019-03-28 12:43:54,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 292.22/254.85 [2019-03-28 12:43:54,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 292.22/254.85 [2019-03-28 12:43:54,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states 292.22/254.85 [2019-03-28 12:43:54,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. 292.22/254.85 [2019-03-28 12:43:54,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 292.22/254.85 [2019-03-28 12:43:54,817 INFO L87 Difference]: Start difference. First operand 76 states and 151 transitions. Second operand 20 states. 292.22/254.85 [2019-03-28 12:47:26,582 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 72 292.22/254.85 [2019-03-28 12:47:32,000 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 292.22/254.85 [2019-03-28 12:47:32,270 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 292.22/254.85 [2019-03-28 12:47:32,559 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 292.22/254.85 [2019-03-28 12:47:33,100 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 292.22/254.85 [2019-03-28 12:47:33,367 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 292.22/254.85 [2019-03-28 12:47:33,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 292.22/254.85 [2019-03-28 12:47:33,633 INFO L93 Difference]: Finished difference Result 179 states and 353 transitions. 292.22/254.85 [2019-03-28 12:47:33,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 292.22/254.85 [2019-03-28 12:47:33,634 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 292.22/254.85 [2019-03-28 12:47:33,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 292.22/254.85 [2019-03-28 12:47:33,634 INFO L225 Difference]: With dead ends: 179 292.22/254.85 [2019-03-28 12:47:33,635 INFO L226 Difference]: Without dead ends: 0 292.22/254.85 [2019-03-28 12:47:33,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=489, Invalid=1146, Unknown=5, NotChecked=0, Total=1640 292.22/254.85 [2019-03-28 12:47:33,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 292.22/254.85 [2019-03-28 12:47:33,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 292.22/254.85 [2019-03-28 12:47:33,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 292.22/254.85 [2019-03-28 12:47:33,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 292.22/254.85 [2019-03-28 12:47:33,637 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 292.22/254.85 [2019-03-28 12:47:33,637 INFO L84 Accepts]: Finished accepts. word is rejected. 292.22/254.85 [2019-03-28 12:47:33,637 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 292.22/254.85 [2019-03-28 12:47:33,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. 292.22/254.85 [2019-03-28 12:47:33,637 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 292.22/254.85 [2019-03-28 12:47:33,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 292.22/254.85 [2019-03-28 12:47:33,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 292.22/254.85 [2019-03-28 12:47:33,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 292.22/254.85 [2019-03-28 12:47:33,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 292.22/254.85 [2019-03-28 12:47:33,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 292.22/254.85 [2019-03-28 12:47:33,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 292.22/254.85 [2019-03-28 12:47:33,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 292.22/254.85 [2019-03-28 12:47:33,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 292.22/254.85 [2019-03-28 12:47:33,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 292.22/254.85 [2019-03-28 12:47:33,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 292.22/254.85 [2019-03-28 12:47:33,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 292.22/254.85 [2019-03-28 12:47:33,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 292.22/254.85 [2019-03-28 12:47:33,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 292.22/254.85 [2019-03-28 12:47:33,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 292.22/254.85 [2019-03-28 12:47:33,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 292.22/254.85 [2019-03-28 12:47:33,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 292.22/254.85 [2019-03-28 12:47:34,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 292.22/254.85 [2019-03-28 12:47:34,033 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 285 DAG size of output: 207 292.22/254.85 [2019-03-28 12:47:34,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 292.22/254.85 [2019-03-28 12:47:34,194 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 218 292.22/254.85 [2019-03-28 12:47:36,178 WARN L188 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 202 DAG size of output: 122 292.22/254.85 [2019-03-28 12:47:37,300 WARN L188 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 214 DAG size of output: 119 292.22/254.85 [2019-03-28 12:47:37,304 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,304 INFO L448 ceAbstractionStarter]: For program point L29-2(lines 26 41) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,304 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,304 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,304 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 38) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,305 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,305 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 15 22) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,305 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,305 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,305 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 38) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,306 INFO L444 ceAbstractionStarter]: At program point L15-4(lines 15 22) the Hoare annotation is: (let ((.cse2 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (let ((.cse9 (= ULTIMATE.start_cstrpbrk_~s2.offset 0)) (.cse12 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse19 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse3 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse15 (= 1 (select |#valid| ULTIMATE.start_cstrpbrk_~s2.base))) (.cse7 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s2.base) (+ ULTIMATE.start_main_~nondetString2~0.offset (select |#length| ULTIMATE.start_cstrpbrk_~s2.base) (- 1))) 0)))) (.cse18 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base)) (.cse10 (= ULTIMATE.start_main_~length1~0 .cse2)) (.cse6 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse0 (not (= ULTIMATE.start_cstrpbrk_~s2.base ULTIMATE.start_cstrpbrk_~sc1~0.base))) (.cse14 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse4 (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (- 1))) 0)))) (.cse5 (= ULTIMATE.start_main_~nondetString2~0.offset 0)) (.cse16 (= (select |#valid| ULTIMATE.start_cstrpbrk_~sc1~0.base) 1))) (or (let ((.cse1 (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base))) (and .cse0 (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 2) .cse1) (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~nondetString2~0.base (store (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)) ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset .cse2 (- 1)))) .cse3 .cse4 .cse5 (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (and (<= 1 ULTIMATE.start_cstrpbrk_~sc1~0.offset) (<= 1 ULTIMATE.start_main_~length1~0) .cse6 .cse7 (and (let ((.cse8 (not (= ULTIMATE.start_cstrpbrk_~c~0 0))) (.cse11 (= (select |#valid| ULTIMATE.start_cstrpbrk_~s~0.base) 1)) (.cse13 (<= 1 (select |#length| ULTIMATE.start_cstrpbrk_~s2.base))) (.cse17 (= 1 .cse18))) (or (and .cse8 .cse9 (<= 1 ULTIMATE.start_cstrpbrk_~s~0.offset) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse8 .cse9 .cse10 .cse11 .cse12 (= 0 ULTIMATE.start_cstrpbrk_~s~0.offset) .cse13 .cse14 .cse15 .cse16 .cse17))) .cse19)) (= (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s~0.base) (+ .cse1 (- 1))) 0))) (and .cse9 .cse12 .cse19 .cse3 .cse15 .cse7 (= .cse18 1) (= 0 ULTIMATE.start_cstrpbrk_~sc1~0.offset) (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset (select |#length| ULTIMATE.start_main_~nondetString1~0.base) (- 1)))))) .cse10 .cse6 .cse0 (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int) (ULTIMATE.start_main_~length1~0 Int)) (and (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_cstrpbrk_~sc1~0.offset ULTIMATE.start_main_~nondetString1~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0 (- 1))) 0) (<= (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)))) (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset) (select |#length| ULTIMATE.start_cstrpbrk_~s2.base)) (<= ULTIMATE.start_cstrpbrk_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (<= 1 ULTIMATE.start_main_~length2~0))) .cse14 .cse4 .cse5 .cse16 (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (<= 1 ULTIMATE.start_main_~length1~0) (<= (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0) (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0 (- 1))) 0))))))) 292.22/254.85 [2019-03-28 12:47:37,306 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,306 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 32 34) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,306 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,306 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,306 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,306 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,307 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,307 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,307 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,307 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,307 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,307 INFO L448 ceAbstractionStarter]: For program point L18-2(line 18) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,307 INFO L448 ceAbstractionStarter]: For program point L18-3(line 18) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,307 INFO L448 ceAbstractionStarter]: For program point L18-4(line 18) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,307 INFO L448 ceAbstractionStarter]: For program point L18-6(lines 18 19) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,308 INFO L444 ceAbstractionStarter]: At program point L18-8(lines 18 19) the Hoare annotation is: (let ((.cse24 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~sc1~0.base) ULTIMATE.start_cstrpbrk_~sc1~0.offset)) (.cse32 (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) (.cse33 (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)) (.cse31 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (let ((.cse3 (= 0 ULTIMATE.start_cstrpbrk_~sc1~0.offset)) (.cse19 (= 1 .cse31)) (.cse20 (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int) (ULTIMATE.start_main_~length1~0 Int)) (and (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_cstrpbrk_~sc1~0.offset ULTIMATE.start_main_~nondetString1~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0 (- 1))) 0) (<= (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base))))) (.cse25 (= 0 ULTIMATE.start_cstrpbrk_~s~0.offset)) (.cse26 (<= 1 .cse33)) (.cse7 (= ULTIMATE.start_cstrpbrk_~s2.offset 0)) (.cse10 (= (select |#valid| ULTIMATE.start_cstrpbrk_~s~0.base) 1)) (.cse12 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse13 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse15 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse16 (= 1 (select |#valid| ULTIMATE.start_cstrpbrk_~s2.base))) (.cse4 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s2.base) (+ ULTIMATE.start_main_~nondetString2~0.offset (select |#length| ULTIMATE.start_cstrpbrk_~s2.base) (- 1))) 0)))) (.cse5 (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) .cse33)) (.cse6 (not (= ULTIMATE.start_cstrpbrk_~c~0 0))) (.cse8 (<= 1 ULTIMATE.start_cstrpbrk_~s~0.offset)) (.cse9 (= ULTIMATE.start_main_~length1~0 .cse32)) (.cse2 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse11 (not (= 0 .cse24))) (.cse14 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse17 (= ULTIMATE.start_main_~nondetString2~0.offset 0)) (.cse18 (= (select |#valid| ULTIMATE.start_cstrpbrk_~sc1~0.base) 1)) (.cse21 (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (<= 1 ULTIMATE.start_main_~length1~0) (<= (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0) (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0 (- 1))) 0)))) (.cse22 (= (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s~0.base) (+ .cse33 (- 1))) 0)) (.cse0 (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~nondetString2~0.base (store (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)) ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset .cse32 (- 1))))) (.cse1 (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (- 1))) 0)))) (.cse23 (not (= ULTIMATE.start_cstrpbrk_~s2.base ULTIMATE.start_cstrpbrk_~sc1~0.base)))) (or (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= 1 (select |#length| ULTIMATE.start_cstrpbrk_~s2.base)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse20 .cse21 .cse22) .cse23) (and (= ULTIMATE.start_cstrpbrk_~c~0 .cse24) .cse3 .cse2 (and .cse7 .cse9 .cse11 .cse12 .cse13 .cse25 .cse14 .cse26 .cse15 .cse16 .cse17 .cse18 .cse19) .cse23 .cse20 (= ULTIMATE.start_cstrpbrk_~s~0.base ULTIMATE.start_cstrpbrk_~s2.base) .cse0 .cse1 .cse21 .cse22) (and (let ((.cse27 (<= 1 ULTIMATE.start_cstrpbrk_~sc1~0.offset)) (.cse28 (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base))) (.cse29 (= .cse31 1)) (.cse30 (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset) (select |#length| ULTIMATE.start_cstrpbrk_~s2.base)) (<= ULTIMATE.start_cstrpbrk_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (<= 1 ULTIMATE.start_main_~length2~0))))) (or (and .cse7 .cse10 .cse12 .cse13 .cse25 .cse27 .cse15 .cse16 .cse4 .cse28 .cse6 .cse29 .cse9 .cse2 .cse11 .cse30 .cse14 .cse26 .cse17 .cse18 .cse21 .cse22) (and .cse7 .cse10 .cse12 .cse13 .cse27 .cse15 .cse16 .cse4 .cse28 .cse5 .cse6 .cse29 .cse8 .cse9 .cse2 .cse11 .cse30 .cse14 .cse17 .cse18 .cse21 .cse22))) .cse0 .cse1 .cse23)))) 292.22/254.85 [2019-03-28 12:47:37,308 INFO L448 ceAbstractionStarter]: For program point L18-9(lines 18 19) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,308 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,308 INFO L448 ceAbstractionStarter]: For program point L37-1(line 37) no Hoare annotation was computed. 292.22/254.85 [2019-03-28 12:47:37,309 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 292.22/254.85 [2019-03-28 12:47:37,320 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,321 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,322 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,322 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,322 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,323 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,323 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,324 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,324 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,324 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,324 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,325 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,325 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,325 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,325 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,326 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,326 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,327 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,327 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,327 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,327 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,328 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,328 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,328 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,329 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,329 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,329 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,330 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,330 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,332 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,332 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,332 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,333 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,333 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,333 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,334 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,334 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,334 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,335 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,335 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,336 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,336 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,336 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,337 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,337 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,337 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,337 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,338 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,338 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,338 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,339 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,345 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,345 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,346 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,346 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,346 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,346 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,347 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,347 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,347 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,347 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,348 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,348 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,348 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,349 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,349 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,349 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,349 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,350 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,350 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,350 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,351 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,351 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,351 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,352 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,352 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,352 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,352 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,356 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,356 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,356 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,357 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,357 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,357 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,357 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,358 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,358 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,358 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,359 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,359 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,359 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,360 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,360 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,360 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,361 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,361 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,361 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,361 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,362 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,362 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,362 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,362 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,363 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,363 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,363 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,396 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,396 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,396 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,396 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,397 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,397 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,397 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,397 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,398 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,398 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,398 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,399 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,399 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,399 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,399 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,400 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,400 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,400 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,400 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,401 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,401 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,401 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,402 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,402 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,402 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,402 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,403 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,403 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,403 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,403 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,404 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,404 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,404 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,404 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,404 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,405 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,405 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,405 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,406 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,406 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,406 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,407 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,407 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,407 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,407 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,408 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,408 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,408 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,408 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,409 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,409 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,409 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,410 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,410 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,410 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,410 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,411 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,411 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,411 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,411 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,412 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,412 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,412 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,412 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,413 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,416 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,416 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,420 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,420 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,420 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,420 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,423 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,423 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,423 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,423 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,423 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,424 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,425 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,425 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,425 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,426 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,426 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,426 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,426 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,427 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,427 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,427 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,427 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,428 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,428 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,428 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,428 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,429 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,429 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,429 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,429 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,430 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,430 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,430 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,433 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,438 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,438 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,438 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,438 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,439 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,439 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,439 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,439 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,439 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,440 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,440 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,440 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,440 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,441 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,441 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,441 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.85 [2019-03-28 12:47:37,442 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,442 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,443 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,443 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,443 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,443 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,443 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,444 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,444 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,444 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,444 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,445 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,445 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,445 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,445 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,446 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,446 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,446 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,446 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,447 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,447 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,447 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,448 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,448 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,448 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,448 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,449 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,449 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,449 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,449 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:37,449 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.85 [2019-03-28 12:47:37,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:47:37 BasicIcfg 292.22/254.85 [2019-03-28 12:47:37,452 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 292.22/254.85 [2019-03-28 12:47:37,453 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 292.22/254.85 [2019-03-28 12:47:37,453 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 292.22/254.85 [2019-03-28 12:47:37,457 INFO L276 PluginConnector]: BuchiAutomizer initialized 292.22/254.85 [2019-03-28 12:47:37,457 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 292.22/254.85 [2019-03-28 12:47:37,458 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:43:32" (1/5) ... 292.22/254.85 [2019-03-28 12:47:37,458 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61c52ce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:47:37, skipping insertion in model container 292.22/254.85 [2019-03-28 12:47:37,458 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 292.22/254.85 [2019-03-28 12:47:37,458 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:33" (2/5) ... 292.22/254.85 [2019-03-28 12:47:37,459 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61c52ce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:47:37, skipping insertion in model container 292.22/254.85 [2019-03-28 12:47:37,459 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 292.22/254.85 [2019-03-28 12:47:37,459 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:43:33" (3/5) ... 292.22/254.85 [2019-03-28 12:47:37,459 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61c52ce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:47:37, skipping insertion in model container 292.22/254.85 [2019-03-28 12:47:37,459 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 292.22/254.85 [2019-03-28 12:47:37,459 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:43:33" (4/5) ... 292.22/254.85 [2019-03-28 12:47:37,460 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61c52ce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:47:37, skipping insertion in model container 292.22/254.85 [2019-03-28 12:47:37,460 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 292.22/254.85 [2019-03-28 12:47:37,460 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:47:37" (5/5) ... 292.22/254.85 [2019-03-28 12:47:37,461 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 292.22/254.85 [2019-03-28 12:47:37,483 INFO L133 ementStrategyFactory]: Using default assertion order modulation 292.22/254.85 [2019-03-28 12:47:37,483 INFO L374 BuchiCegarLoop]: Interprodecural is true 292.22/254.85 [2019-03-28 12:47:37,483 INFO L375 BuchiCegarLoop]: Hoare is true 292.22/254.85 [2019-03-28 12:47:37,483 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 292.22/254.85 [2019-03-28 12:47:37,483 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 292.22/254.85 [2019-03-28 12:47:37,483 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 292.22/254.85 [2019-03-28 12:47:37,483 INFO L379 BuchiCegarLoop]: Difference is false 292.22/254.85 [2019-03-28 12:47:37,484 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 292.22/254.85 [2019-03-28 12:47:37,484 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 292.22/254.85 [2019-03-28 12:47:37,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. 292.22/254.85 [2019-03-28 12:47:37,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 292.22/254.85 [2019-03-28 12:47:37,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 292.22/254.85 [2019-03-28 12:47:37,492 INFO L119 BuchiIsEmpty]: Starting construction of run 292.22/254.85 [2019-03-28 12:47:37,497 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 292.22/254.85 [2019-03-28 12:47:37,497 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 292.22/254.85 [2019-03-28 12:47:37,497 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 292.22/254.85 [2019-03-28 12:47:37,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. 292.22/254.85 [2019-03-28 12:47:37,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 292.22/254.85 [2019-03-28 12:47:37,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 292.22/254.85 [2019-03-28 12:47:37,499 INFO L119 BuchiIsEmpty]: Starting construction of run 292.22/254.85 [2019-03-28 12:47:37,499 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 292.22/254.85 [2019-03-28 12:47:37,499 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 292.22/254.85 [2019-03-28 12:47:37,505 INFO L794 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue [201] ULTIMATE.startENTRY-->L29: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 7#L29true [92] L29-->L29-2: Formula: (and (= v_ULTIMATE.start_main_~length1~0_4 1) (< v_ULTIMATE.start_main_~length1~0_5 1)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_5} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length1~0] 5#L29-2true [88] L29-2-->L32-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 8#L32-1true [154] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1) |v_#valid_5|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) 0) (= |v_ULTIMATE.start_main_#t~malloc10.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc10.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (= |v_#length_3| (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_5|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc10.offset] 17#L37true [108] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_2| (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 31#L37-1true [202] L37-1-->L15-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13 v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_12, ULTIMATE.start_cstrpbrk_#in~s2.base=|v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|, ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_3, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13, #length=|v_#length_18|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start_cstrpbrk_#t~post6.base=|v_ULTIMATE.start_cstrpbrk_#t~post6.base_4|, ULTIMATE.start_cstrpbrk_#t~mem7=|v_ULTIMATE.start_cstrpbrk_#t~mem7_7|, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_6|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_7|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3, ULTIMATE.start_cstrpbrk_#t~post6.offset=|v_ULTIMATE.start_cstrpbrk_#t~post6.offset_4|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_15, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_~s~0.offset, ULTIMATE.start_cstrpbrk_#in~s2.base, ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#in~s1.base, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#in~s1.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start_cstrpbrk_#t~post6.base, ULTIMATE.start_cstrpbrk_#t~mem7, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem2, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, ULTIMATE.start_cstrpbrk_#t~post6.offset, #memory_int, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset] 27#L15-4true 292.22/254.85 [2019-03-28 12:47:37,505 INFO L796 eck$LassoCheckResult]: Loop: 27#L15-4true [120] L15-4-->L15-1: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7)) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7 1) (select |v_#length_10| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem1] 30#L15-1true [167] L15-1-->L17: Formula: (and (> |v_ULTIMATE.start_cstrpbrk_#t~mem1_6| 0) (= v_ULTIMATE.start_cstrpbrk_~s~0.offset_5 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (= v_ULTIMATE.start_cstrpbrk_~s~0.base_6 v_ULTIMATE.start_cstrpbrk_~s2.base_3)) InVars {ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_6|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_6, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_~s~0.offset] 19#L17true [204] L17-->L18-8: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12 1) (select |v_#length_19| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= v_ULTIMATE.start_cstrpbrk_~c~0_8 (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_#t~mem2] 10#L18-8true [100] L18-8-->L18-1: Formula: (and (= (select |v_#valid_19| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) 1) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_6 1) (select |v_#length_14| v_ULTIMATE.start_cstrpbrk_~s~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_6) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) v_ULTIMATE.start_cstrpbrk_~s~0.offset_6))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_2|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem3] 6#L18-1true [181] L18-1-->L18-2: Formula: (and (> |v_ULTIMATE.start_cstrpbrk_#t~mem3_3| 0) |v_ULTIMATE.start_cstrpbrk_#t~short5_2|) InVars {ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_2|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5] 4#L18-2true [87] L18-2-->L18-6: Formula: (not |v_ULTIMATE.start_cstrpbrk_#t~short5_5|) InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_5|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_5|} AuxVars[] AssignedVars[] 12#L18-6true [103] L18-6-->L18-9: Formula: (not |v_ULTIMATE.start_cstrpbrk_#t~short5_7|) InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_7|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_6|, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_4|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3] 24#L18-9true [208] L18-9-->L15-4: Formula: (and (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_13 1) (select |v_#length_20| v_ULTIMATE.start_cstrpbrk_~s~0.base_16)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_cstrpbrk_~s~0.base_16)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18 v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_cstrpbrk_~s~0.base_16) v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) v_ULTIMATE.start_cstrpbrk_~c~0_10) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15 (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16 1))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_20|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} OutVars{ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_6|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15, ULTIMATE.start_cstrpbrk_#t~mem7=|v_ULTIMATE.start_cstrpbrk_#t~mem7_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_20|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_6|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_#t~mem7, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset] 27#L15-4true 292.22/254.85 [2019-03-28 12:47:37,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.85 [2019-03-28 12:47:37,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1860234476, now seen corresponding path program 1 times 292.22/254.85 [2019-03-28 12:47:37,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.85 [2019-03-28 12:47:37,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.85 [2019-03-28 12:47:37,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:37,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:37,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 292.22/254.85 [2019-03-28 12:47:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 292.22/254.85 [2019-03-28 12:47:37,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.85 [2019-03-28 12:47:37,539 INFO L82 PathProgramCache]: Analyzing trace with hash 703825683, now seen corresponding path program 1 times 292.22/254.85 [2019-03-28 12:47:37,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.85 [2019-03-28 12:47:37,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.85 [2019-03-28 12:47:37,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:37,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:37,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.85 [2019-03-28 12:47:37,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.85 [2019-03-28 12:47:37,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 292.22/254.85 [2019-03-28 12:47:37,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 292.22/254.85 [2019-03-28 12:47:37,549 INFO L811 eck$LassoCheckResult]: loop already infeasible 292.22/254.85 [2019-03-28 12:47:37,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 292.22/254.85 [2019-03-28 12:47:37,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 292.22/254.85 [2019-03-28 12:47:37,551 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. 292.22/254.85 [2019-03-28 12:47:37,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 292.22/254.85 [2019-03-28 12:47:37,630 INFO L93 Difference]: Finished difference Result 32 states and 64 transitions. 292.22/254.85 [2019-03-28 12:47:37,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 292.22/254.85 [2019-03-28 12:47:37,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 64 transitions. 292.22/254.85 [2019-03-28 12:47:37,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 292.22/254.85 [2019-03-28 12:47:37,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 18 states and 36 transitions. 292.22/254.85 [2019-03-28 12:47:37,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 292.22/254.85 [2019-03-28 12:47:37,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 292.22/254.85 [2019-03-28 12:47:37,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 36 transitions. 292.22/254.85 [2019-03-28 12:47:37,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 292.22/254.85 [2019-03-28 12:47:37,637 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 36 transitions. 292.22/254.85 [2019-03-28 12:47:37,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 36 transitions. 292.22/254.85 [2019-03-28 12:47:37,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 292.22/254.85 [2019-03-28 12:47:37,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 292.22/254.85 [2019-03-28 12:47:37,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 36 transitions. 292.22/254.85 [2019-03-28 12:47:37,640 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 36 transitions. 292.22/254.85 [2019-03-28 12:47:37,640 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 36 transitions. 292.22/254.85 [2019-03-28 12:47:37,640 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 292.22/254.85 [2019-03-28 12:47:37,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 36 transitions. 292.22/254.85 [2019-03-28 12:47:37,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 292.22/254.85 [2019-03-28 12:47:37,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 292.22/254.85 [2019-03-28 12:47:37,641 INFO L119 BuchiIsEmpty]: Starting construction of run 292.22/254.85 [2019-03-28 12:47:37,641 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 292.22/254.85 [2019-03-28 12:47:37,641 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 292.22/254.85 [2019-03-28 12:47:37,642 INFO L794 eck$LassoCheckResult]: Stem: 85#ULTIMATE.startENTRY [201] ULTIMATE.startENTRY-->L29: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 82#L29 [92] L29-->L29-2: Formula: (and (= v_ULTIMATE.start_main_~length1~0_4 1) (< v_ULTIMATE.start_main_~length1~0_5 1)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_5} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length1~0] 76#L29-2 [88] L29-2-->L32-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 77#L32-1 [154] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1) |v_#valid_5|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) 0) (= |v_ULTIMATE.start_main_#t~malloc10.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc10.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (= |v_#length_3| (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_5|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc10.offset] 73#L37 [108] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_2| (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 74#L37-1 [202] L37-1-->L15-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13 v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_12, ULTIMATE.start_cstrpbrk_#in~s2.base=|v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|, ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_3, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13, #length=|v_#length_18|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start_cstrpbrk_#t~post6.base=|v_ULTIMATE.start_cstrpbrk_#t~post6.base_4|, ULTIMATE.start_cstrpbrk_#t~mem7=|v_ULTIMATE.start_cstrpbrk_#t~mem7_7|, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_6|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_7|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3, ULTIMATE.start_cstrpbrk_#t~post6.offset=|v_ULTIMATE.start_cstrpbrk_#t~post6.offset_4|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_15, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_~s~0.offset, ULTIMATE.start_cstrpbrk_#in~s2.base, ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#in~s1.base, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#in~s1.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start_cstrpbrk_#t~post6.base, ULTIMATE.start_cstrpbrk_#t~mem7, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem2, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, ULTIMATE.start_cstrpbrk_#t~post6.offset, #memory_int, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset] 84#L15-4 292.22/254.85 [2019-03-28 12:47:37,642 INFO L796 eck$LassoCheckResult]: Loop: 84#L15-4 [120] L15-4-->L15-1: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7)) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7 1) (select |v_#length_10| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem1] 86#L15-1 [167] L15-1-->L17: Formula: (and (> |v_ULTIMATE.start_cstrpbrk_#t~mem1_6| 0) (= v_ULTIMATE.start_cstrpbrk_~s~0.offset_5 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (= v_ULTIMATE.start_cstrpbrk_~s~0.base_6 v_ULTIMATE.start_cstrpbrk_~s2.base_3)) InVars {ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_6|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_6, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_~s~0.offset] 78#L17 [204] L17-->L18-8: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12 1) (select |v_#length_19| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= v_ULTIMATE.start_cstrpbrk_~c~0_8 (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_#t~mem2] 79#L18-8 [100] L18-8-->L18-1: Formula: (and (= (select |v_#valid_19| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) 1) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_6 1) (select |v_#length_14| v_ULTIMATE.start_cstrpbrk_~s~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_6) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) v_ULTIMATE.start_cstrpbrk_~s~0.offset_6))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_2|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem3] 80#L18-1 [183] L18-1-->L18-2: Formula: (and (not |v_ULTIMATE.start_cstrpbrk_#t~short5_2|) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_3| 0)) InVars {ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_2|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5] 81#L18-2 [87] L18-2-->L18-6: Formula: (not |v_ULTIMATE.start_cstrpbrk_#t~short5_5|) InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_5|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_5|} AuxVars[] AssignedVars[] 88#L18-6 [103] L18-6-->L18-9: Formula: (not |v_ULTIMATE.start_cstrpbrk_#t~short5_7|) InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_7|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_6|, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_4|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3] 83#L18-9 [208] L18-9-->L15-4: Formula: (and (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_13 1) (select |v_#length_20| v_ULTIMATE.start_cstrpbrk_~s~0.base_16)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_cstrpbrk_~s~0.base_16)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18 v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_cstrpbrk_~s~0.base_16) v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) v_ULTIMATE.start_cstrpbrk_~c~0_10) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15 (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16 1))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_20|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} OutVars{ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_6|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15, ULTIMATE.start_cstrpbrk_#t~mem7=|v_ULTIMATE.start_cstrpbrk_#t~mem7_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_20|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_6|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_#t~mem7, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset] 84#L15-4 292.22/254.85 [2019-03-28 12:47:37,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.85 [2019-03-28 12:47:37,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1860234476, now seen corresponding path program 2 times 292.22/254.85 [2019-03-28 12:47:37,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.85 [2019-03-28 12:47:37,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.85 [2019-03-28 12:47:37,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:37,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:37,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 292.22/254.85 [2019-03-28 12:47:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 292.22/254.85 [2019-03-28 12:47:37,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.85 [2019-03-28 12:47:37,658 INFO L82 PathProgramCache]: Analyzing trace with hash 703885265, now seen corresponding path program 1 times 292.22/254.85 [2019-03-28 12:47:37,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.85 [2019-03-28 12:47:37,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.85 [2019-03-28 12:47:37,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:37,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:37,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.85 [2019-03-28 12:47:37,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.85 [2019-03-28 12:47:37,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 292.22/254.85 [2019-03-28 12:47:37,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 292.22/254.85 [2019-03-28 12:47:37,708 INFO L811 eck$LassoCheckResult]: loop already infeasible 292.22/254.85 [2019-03-28 12:47:37,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 292.22/254.85 [2019-03-28 12:47:37,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 292.22/254.85 [2019-03-28 12:47:37,709 INFO L87 Difference]: Start difference. First operand 18 states and 36 transitions. cyclomatic complexity: 19 Second operand 7 states. 292.22/254.85 [2019-03-28 12:47:37,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 292.22/254.85 [2019-03-28 12:47:37,916 INFO L93 Difference]: Finished difference Result 26 states and 53 transitions. 292.22/254.85 [2019-03-28 12:47:37,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 292.22/254.85 [2019-03-28 12:47:37,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 53 transitions. 292.22/254.85 [2019-03-28 12:47:37,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 292.22/254.85 [2019-03-28 12:47:37,920 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 25 states and 52 transitions. 292.22/254.85 [2019-03-28 12:47:37,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 292.22/254.85 [2019-03-28 12:47:37,920 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 292.22/254.85 [2019-03-28 12:47:37,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 52 transitions. 292.22/254.85 [2019-03-28 12:47:37,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 292.22/254.85 [2019-03-28 12:47:37,921 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 52 transitions. 292.22/254.85 [2019-03-28 12:47:37,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 52 transitions. 292.22/254.85 [2019-03-28 12:47:37,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. 292.22/254.85 [2019-03-28 12:47:37,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 292.22/254.85 [2019-03-28 12:47:37,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 46 transitions. 292.22/254.85 [2019-03-28 12:47:37,924 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 46 transitions. 292.22/254.85 [2019-03-28 12:47:37,924 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 46 transitions. 292.22/254.85 [2019-03-28 12:47:37,924 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 292.22/254.85 [2019-03-28 12:47:37,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 46 transitions. 292.22/254.85 [2019-03-28 12:47:37,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 292.22/254.85 [2019-03-28 12:47:37,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 292.22/254.85 [2019-03-28 12:47:37,925 INFO L119 BuchiIsEmpty]: Starting construction of run 292.22/254.85 [2019-03-28 12:47:37,925 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 292.22/254.85 [2019-03-28 12:47:37,925 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 292.22/254.85 [2019-03-28 12:47:37,926 INFO L794 eck$LassoCheckResult]: Stem: 150#ULTIMATE.startENTRY [201] ULTIMATE.startENTRY-->L29: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 147#L29 [92] L29-->L29-2: Formula: (and (= v_ULTIMATE.start_main_~length1~0_4 1) (< v_ULTIMATE.start_main_~length1~0_5 1)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_5} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length1~0] 141#L29-2 [88] L29-2-->L32-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 142#L32-1 [154] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1) |v_#valid_5|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) 0) (= |v_ULTIMATE.start_main_#t~malloc10.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc10.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (= |v_#length_3| (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_5|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc10.offset] 137#L37 [108] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_2| (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 138#L37-1 [202] L37-1-->L15-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13 v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_12, ULTIMATE.start_cstrpbrk_#in~s2.base=|v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|, ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_3, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13, #length=|v_#length_18|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start_cstrpbrk_#t~post6.base=|v_ULTIMATE.start_cstrpbrk_#t~post6.base_4|, ULTIMATE.start_cstrpbrk_#t~mem7=|v_ULTIMATE.start_cstrpbrk_#t~mem7_7|, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_6|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_7|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3, ULTIMATE.start_cstrpbrk_#t~post6.offset=|v_ULTIMATE.start_cstrpbrk_#t~post6.offset_4|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_15, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_~s~0.offset, ULTIMATE.start_cstrpbrk_#in~s2.base, ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#in~s1.base, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#in~s1.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start_cstrpbrk_#t~post6.base, ULTIMATE.start_cstrpbrk_#t~mem7, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem2, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, ULTIMATE.start_cstrpbrk_#t~post6.offset, #memory_int, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset] 149#L15-4 292.22/254.85 [2019-03-28 12:47:37,926 INFO L796 eck$LassoCheckResult]: Loop: 149#L15-4 [120] L15-4-->L15-1: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7)) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7 1) (select |v_#length_10| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem1] 151#L15-1 [167] L15-1-->L17: Formula: (and (> |v_ULTIMATE.start_cstrpbrk_#t~mem1_6| 0) (= v_ULTIMATE.start_cstrpbrk_~s~0.offset_5 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (= v_ULTIMATE.start_cstrpbrk_~s~0.base_6 v_ULTIMATE.start_cstrpbrk_~s2.base_3)) InVars {ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_6|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_6, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_~s~0.offset] 143#L17 [204] L17-->L18-8: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12 1) (select |v_#length_19| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= v_ULTIMATE.start_cstrpbrk_~c~0_8 (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_#t~mem2] 144#L18-8 [100] L18-8-->L18-1: Formula: (and (= (select |v_#valid_19| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) 1) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_6 1) (select |v_#length_14| v_ULTIMATE.start_cstrpbrk_~s~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_6) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) v_ULTIMATE.start_cstrpbrk_~s~0.offset_6))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_2|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem3] 145#L18-1 [181] L18-1-->L18-2: Formula: (and (> |v_ULTIMATE.start_cstrpbrk_#t~mem3_3| 0) |v_ULTIMATE.start_cstrpbrk_#t~short5_2|) InVars {ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_2|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5] 146#L18-2 [86] L18-2-->L18-3: Formula: |v_ULTIMATE.start_cstrpbrk_#t~short5_3| InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_3|} AuxVars[] AssignedVars[] 154#L18-3 [83] L18-3-->L18-4: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_8) (= |v_ULTIMATE.start_cstrpbrk_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_cstrpbrk_~s~0.base_10) v_ULTIMATE.start_cstrpbrk_~s~0.offset_8)) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_8 1) (select |v_#length_16| v_ULTIMATE.start_cstrpbrk_~s~0.base_10)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_cstrpbrk_~s~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_10, #length=|v_#length_16|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_8, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_2|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_10, #length=|v_#length_16|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem4] 153#L18-4 [193] L18-4-->L18-6: Formula: (let ((.cse0 (mod v_ULTIMATE.start_cstrpbrk_~c~0_6 256))) (and (<= .cse0 127) (= |v_ULTIMATE.start_cstrpbrk_#t~mem4_3| .cse0) (not |v_ULTIMATE.start_cstrpbrk_#t~short5_4|))) InVars {ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_6, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_4|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_6, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5] 152#L18-6 [103] L18-6-->L18-9: Formula: (not |v_ULTIMATE.start_cstrpbrk_#t~short5_7|) InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_7|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_6|, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_4|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3] 148#L18-9 [208] L18-9-->L15-4: Formula: (and (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_13 1) (select |v_#length_20| v_ULTIMATE.start_cstrpbrk_~s~0.base_16)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_cstrpbrk_~s~0.base_16)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18 v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_cstrpbrk_~s~0.base_16) v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) v_ULTIMATE.start_cstrpbrk_~c~0_10) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15 (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16 1))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_20|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} OutVars{ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_6|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15, ULTIMATE.start_cstrpbrk_#t~mem7=|v_ULTIMATE.start_cstrpbrk_#t~mem7_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_20|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_6|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_#t~mem7, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset] 149#L15-4 292.22/254.85 [2019-03-28 12:47:37,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.85 [2019-03-28 12:47:37,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1860234476, now seen corresponding path program 3 times 292.22/254.85 [2019-03-28 12:47:37,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.85 [2019-03-28 12:47:37,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.85 [2019-03-28 12:47:37,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:37,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:37,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 292.22/254.85 [2019-03-28 12:47:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 292.22/254.85 [2019-03-28 12:47:37,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.85 [2019-03-28 12:47:37,941 INFO L82 PathProgramCache]: Analyzing trace with hash 2065085536, now seen corresponding path program 1 times 292.22/254.85 [2019-03-28 12:47:37,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.85 [2019-03-28 12:47:37,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.85 [2019-03-28 12:47:37,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:37,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:37,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 292.22/254.85 [2019-03-28 12:47:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 292.22/254.85 [2019-03-28 12:47:37,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.85 [2019-03-28 12:47:37,951 INFO L82 PathProgramCache]: Analyzing trace with hash 2008239027, now seen corresponding path program 1 times 292.22/254.85 [2019-03-28 12:47:37,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.85 [2019-03-28 12:47:37,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.85 [2019-03-28 12:47:37,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:37,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:37,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.85 [2019-03-28 12:47:38,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.85 [2019-03-28 12:47:38,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 292.22/254.85 [2019-03-28 12:47:38,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 292.22/254.85 [2019-03-28 12:47:38,208 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 292.22/254.85 [2019-03-28 12:47:38,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 292.22/254.85 [2019-03-28 12:47:38,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 292.22/254.85 [2019-03-28 12:47:38,253 INFO L87 Difference]: Start difference. First operand 20 states and 46 transitions. cyclomatic complexity: 27 Second operand 9 states. 292.22/254.85 [2019-03-28 12:47:38,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 292.22/254.85 [2019-03-28 12:47:38,694 INFO L93 Difference]: Finished difference Result 40 states and 84 transitions. 292.22/254.85 [2019-03-28 12:47:38,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 292.22/254.85 [2019-03-28 12:47:38,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 84 transitions. 292.22/254.85 [2019-03-28 12:47:38,695 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 292.22/254.85 [2019-03-28 12:47:38,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 83 transitions. 292.22/254.85 [2019-03-28 12:47:38,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 292.22/254.85 [2019-03-28 12:47:38,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 292.22/254.85 [2019-03-28 12:47:38,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 83 transitions. 292.22/254.85 [2019-03-28 12:47:38,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 292.22/254.85 [2019-03-28 12:47:38,697 INFO L706 BuchiCegarLoop]: Abstraction has 39 states and 83 transitions. 292.22/254.85 [2019-03-28 12:47:38,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 83 transitions. 292.22/254.85 [2019-03-28 12:47:38,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. 292.22/254.85 [2019-03-28 12:47:38,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 292.22/254.85 [2019-03-28 12:47:38,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 73 transitions. 292.22/254.85 [2019-03-28 12:47:38,699 INFO L729 BuchiCegarLoop]: Abstraction has 34 states and 73 transitions. 292.22/254.85 [2019-03-28 12:47:38,699 INFO L609 BuchiCegarLoop]: Abstraction has 34 states and 73 transitions. 292.22/254.85 [2019-03-28 12:47:38,699 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 292.22/254.85 [2019-03-28 12:47:38,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 73 transitions. 292.22/254.85 [2019-03-28 12:47:38,700 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 292.22/254.85 [2019-03-28 12:47:38,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 292.22/254.85 [2019-03-28 12:47:38,700 INFO L119 BuchiIsEmpty]: Starting construction of run 292.22/254.85 [2019-03-28 12:47:38,701 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 292.22/254.85 [2019-03-28 12:47:38,701 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 292.22/254.85 [2019-03-28 12:47:38,702 INFO L794 eck$LassoCheckResult]: Stem: 236#ULTIMATE.startENTRY [201] ULTIMATE.startENTRY-->L29: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 230#L29 [130] L29-->L29-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 231#L29-2 [88] L29-2-->L32-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 234#L32-1 [154] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1) |v_#valid_5|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) 0) (= |v_ULTIMATE.start_main_#t~malloc10.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc10.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (= |v_#length_3| (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_5|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc10.offset] 235#L37 [108] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_2| (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 250#L37-1 [202] L37-1-->L15-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13 v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_12, ULTIMATE.start_cstrpbrk_#in~s2.base=|v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|, ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_3, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13, #length=|v_#length_18|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start_cstrpbrk_#t~post6.base=|v_ULTIMATE.start_cstrpbrk_#t~post6.base_4|, ULTIMATE.start_cstrpbrk_#t~mem7=|v_ULTIMATE.start_cstrpbrk_#t~mem7_7|, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_6|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_7|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3, ULTIMATE.start_cstrpbrk_#t~post6.offset=|v_ULTIMATE.start_cstrpbrk_#t~post6.offset_4|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_15, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_~s~0.offset, ULTIMATE.start_cstrpbrk_#in~s2.base, ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#in~s1.base, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#in~s1.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start_cstrpbrk_#t~post6.base, ULTIMATE.start_cstrpbrk_#t~mem7, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem2, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, ULTIMATE.start_cstrpbrk_#t~post6.offset, #memory_int, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset] 233#L15-4 292.22/254.85 [2019-03-28 12:47:38,702 INFO L796 eck$LassoCheckResult]: Loop: 233#L15-4 [120] L15-4-->L15-1: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7)) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7 1) (select |v_#length_10| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem1] 240#L15-1 [167] L15-1-->L17: Formula: (and (> |v_ULTIMATE.start_cstrpbrk_#t~mem1_6| 0) (= v_ULTIMATE.start_cstrpbrk_~s~0.offset_5 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (= v_ULTIMATE.start_cstrpbrk_~s~0.base_6 v_ULTIMATE.start_cstrpbrk_~s2.base_3)) InVars {ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_6|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_6, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_~s~0.offset] 241#L17 [204] L17-->L18-8: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12 1) (select |v_#length_19| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= v_ULTIMATE.start_cstrpbrk_~c~0_8 (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_#t~mem2] 243#L18-8 [100] L18-8-->L18-1: Formula: (and (= (select |v_#valid_19| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) 1) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_6 1) (select |v_#length_14| v_ULTIMATE.start_cstrpbrk_~s~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_6) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) v_ULTIMATE.start_cstrpbrk_~s~0.offset_6))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_2|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem3] 248#L18-1 [181] L18-1-->L18-2: Formula: (and (> |v_ULTIMATE.start_cstrpbrk_#t~mem3_3| 0) |v_ULTIMATE.start_cstrpbrk_#t~short5_2|) InVars {ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_2|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5] 247#L18-2 [86] L18-2-->L18-3: Formula: |v_ULTIMATE.start_cstrpbrk_#t~short5_3| InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_3|} AuxVars[] AssignedVars[] 246#L18-3 [83] L18-3-->L18-4: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_8) (= |v_ULTIMATE.start_cstrpbrk_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_cstrpbrk_~s~0.base_10) v_ULTIMATE.start_cstrpbrk_~s~0.offset_8)) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_8 1) (select |v_#length_16| v_ULTIMATE.start_cstrpbrk_~s~0.base_10)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_cstrpbrk_~s~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_10, #length=|v_#length_16|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_8, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_2|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_10, #length=|v_#length_16|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem4] 244#L18-4 [193] L18-4-->L18-6: Formula: (let ((.cse0 (mod v_ULTIMATE.start_cstrpbrk_~c~0_6 256))) (and (<= .cse0 127) (= |v_ULTIMATE.start_cstrpbrk_#t~mem4_3| .cse0) (not |v_ULTIMATE.start_cstrpbrk_#t~short5_4|))) InVars {ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_6, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_4|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_6, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5] 242#L18-6 [103] L18-6-->L18-9: Formula: (not |v_ULTIMATE.start_cstrpbrk_#t~short5_7|) InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_7|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_6|, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_4|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3] 232#L18-9 [208] L18-9-->L15-4: Formula: (and (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_13 1) (select |v_#length_20| v_ULTIMATE.start_cstrpbrk_~s~0.base_16)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_cstrpbrk_~s~0.base_16)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18 v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_cstrpbrk_~s~0.base_16) v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) v_ULTIMATE.start_cstrpbrk_~c~0_10) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15 (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16 1))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_20|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} OutVars{ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_6|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15, ULTIMATE.start_cstrpbrk_#t~mem7=|v_ULTIMATE.start_cstrpbrk_#t~mem7_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_20|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_6|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_#t~mem7, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset] 233#L15-4 292.22/254.85 [2019-03-28 12:47:38,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.85 [2019-03-28 12:47:38,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1825140678, now seen corresponding path program 1 times 292.22/254.85 [2019-03-28 12:47:38,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.85 [2019-03-28 12:47:38,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.85 [2019-03-28 12:47:38,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:38,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:38,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 292.22/254.85 [2019-03-28 12:47:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 292.22/254.85 [2019-03-28 12:47:38,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.85 [2019-03-28 12:47:38,716 INFO L82 PathProgramCache]: Analyzing trace with hash 2065085536, now seen corresponding path program 2 times 292.22/254.85 [2019-03-28 12:47:38,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.85 [2019-03-28 12:47:38,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.85 [2019-03-28 12:47:38,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:38,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:38,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 292.22/254.85 [2019-03-28 12:47:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 292.22/254.85 [2019-03-28 12:47:38,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.85 [2019-03-28 12:47:38,726 INFO L82 PathProgramCache]: Analyzing trace with hash -834334375, now seen corresponding path program 1 times 292.22/254.85 [2019-03-28 12:47:38,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.85 [2019-03-28 12:47:38,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.85 [2019-03-28 12:47:38,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:38,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:38,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.85 [2019-03-28 12:47:38,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.85 [2019-03-28 12:47:38,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 292.22/254.85 [2019-03-28 12:47:38,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 292.22/254.85 [2019-03-28 12:47:38,928 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 292.22/254.85 [2019-03-28 12:47:38,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 292.22/254.85 [2019-03-28 12:47:38,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 292.22/254.85 [2019-03-28 12:47:38,963 INFO L87 Difference]: Start difference. First operand 34 states and 73 transitions. cyclomatic complexity: 41 Second operand 7 states. 292.22/254.85 [2019-03-28 12:47:39,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 292.22/254.85 [2019-03-28 12:47:39,188 INFO L93 Difference]: Finished difference Result 76 states and 166 transitions. 292.22/254.85 [2019-03-28 12:47:39,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 292.22/254.85 [2019-03-28 12:47:39,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 166 transitions. 292.22/254.85 [2019-03-28 12:47:39,190 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 48 292.22/254.85 [2019-03-28 12:47:39,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 166 transitions. 292.22/254.85 [2019-03-28 12:47:39,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 292.22/254.85 [2019-03-28 12:47:39,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 292.22/254.85 [2019-03-28 12:47:39,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 166 transitions. 292.22/254.85 [2019-03-28 12:47:39,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 292.22/254.85 [2019-03-28 12:47:39,193 INFO L706 BuchiCegarLoop]: Abstraction has 76 states and 166 transitions. 292.22/254.85 [2019-03-28 12:47:39,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 166 transitions. 292.22/254.85 [2019-03-28 12:47:39,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. 292.22/254.85 [2019-03-28 12:47:39,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. 292.22/254.85 [2019-03-28 12:47:39,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 128 transitions. 292.22/254.85 [2019-03-28 12:47:39,195 INFO L729 BuchiCegarLoop]: Abstraction has 61 states and 128 transitions. 292.22/254.85 [2019-03-28 12:47:39,196 INFO L609 BuchiCegarLoop]: Abstraction has 61 states and 128 transitions. 292.22/254.85 [2019-03-28 12:47:39,196 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 292.22/254.85 [2019-03-28 12:47:39,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 128 transitions. 292.22/254.85 [2019-03-28 12:47:39,197 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 292.22/254.85 [2019-03-28 12:47:39,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 292.22/254.85 [2019-03-28 12:47:39,197 INFO L119 BuchiIsEmpty]: Starting construction of run 292.22/254.85 [2019-03-28 12:47:39,198 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 292.22/254.85 [2019-03-28 12:47:39,198 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 292.22/254.85 [2019-03-28 12:47:39,198 INFO L794 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY [201] ULTIMATE.startENTRY-->L29: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 359#L29 [130] L29-->L29-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 360#L29-2 [131] L29-2-->L32-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 388#L32-1 [154] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1) |v_#valid_5|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) 0) (= |v_ULTIMATE.start_main_#t~malloc10.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc10.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (= |v_#length_3| (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_5|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc10.offset] 386#L37 [108] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_2| (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 385#L37-1 [202] L37-1-->L15-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13 v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_12, ULTIMATE.start_cstrpbrk_#in~s2.base=|v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|, ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_3, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13, #length=|v_#length_18|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start_cstrpbrk_#t~post6.base=|v_ULTIMATE.start_cstrpbrk_#t~post6.base_4|, ULTIMATE.start_cstrpbrk_#t~mem7=|v_ULTIMATE.start_cstrpbrk_#t~mem7_7|, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_6|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_7|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3, ULTIMATE.start_cstrpbrk_#t~post6.offset=|v_ULTIMATE.start_cstrpbrk_#t~post6.offset_4|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_15, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_~s~0.offset, ULTIMATE.start_cstrpbrk_#in~s2.base, ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#in~s1.base, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#in~s1.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start_cstrpbrk_#t~post6.base, ULTIMATE.start_cstrpbrk_#t~mem7, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem2, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, ULTIMATE.start_cstrpbrk_#t~post6.offset, #memory_int, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset] 384#L15-4 292.22/254.85 [2019-03-28 12:47:39,199 INFO L796 eck$LassoCheckResult]: Loop: 384#L15-4 [120] L15-4-->L15-1: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7)) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7 1) (select |v_#length_10| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem1] 383#L15-1 [167] L15-1-->L17: Formula: (and (> |v_ULTIMATE.start_cstrpbrk_#t~mem1_6| 0) (= v_ULTIMATE.start_cstrpbrk_~s~0.offset_5 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (= v_ULTIMATE.start_cstrpbrk_~s~0.base_6 v_ULTIMATE.start_cstrpbrk_~s2.base_3)) InVars {ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_6|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_6, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_~s~0.offset] 382#L17 [204] L17-->L18-8: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12 1) (select |v_#length_19| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= v_ULTIMATE.start_cstrpbrk_~c~0_8 (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_#t~mem2] 371#L18-8 [100] L18-8-->L18-1: Formula: (and (= (select |v_#valid_19| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) 1) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_6 1) (select |v_#length_14| v_ULTIMATE.start_cstrpbrk_~s~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_6) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) v_ULTIMATE.start_cstrpbrk_~s~0.offset_6))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_2|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem3] 391#L18-1 [181] L18-1-->L18-2: Formula: (and (> |v_ULTIMATE.start_cstrpbrk_#t~mem3_3| 0) |v_ULTIMATE.start_cstrpbrk_#t~short5_2|) InVars {ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_2|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5] 390#L18-2 [86] L18-2-->L18-3: Formula: |v_ULTIMATE.start_cstrpbrk_#t~short5_3| InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_3|} AuxVars[] AssignedVars[] 375#L18-3 [83] L18-3-->L18-4: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_8) (= |v_ULTIMATE.start_cstrpbrk_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_cstrpbrk_~s~0.base_10) v_ULTIMATE.start_cstrpbrk_~s~0.offset_8)) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_8 1) (select |v_#length_16| v_ULTIMATE.start_cstrpbrk_~s~0.base_10)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_cstrpbrk_~s~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_10, #length=|v_#length_16|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_8, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_2|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_10, #length=|v_#length_16|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem4] 376#L18-4 [193] L18-4-->L18-6: Formula: (let ((.cse0 (mod v_ULTIMATE.start_cstrpbrk_~c~0_6 256))) (and (<= .cse0 127) (= |v_ULTIMATE.start_cstrpbrk_#t~mem4_3| .cse0) (not |v_ULTIMATE.start_cstrpbrk_#t~short5_4|))) InVars {ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_6, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_4|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_6, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5] 369#L18-6 [103] L18-6-->L18-9: Formula: (not |v_ULTIMATE.start_cstrpbrk_#t~short5_7|) InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_7|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_6|, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_4|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3] 370#L18-9 [208] L18-9-->L15-4: Formula: (and (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_13 1) (select |v_#length_20| v_ULTIMATE.start_cstrpbrk_~s~0.base_16)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_cstrpbrk_~s~0.base_16)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18 v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_cstrpbrk_~s~0.base_16) v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) v_ULTIMATE.start_cstrpbrk_~c~0_10) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15 (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16 1))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_20|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} OutVars{ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_6|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15, ULTIMATE.start_cstrpbrk_#t~mem7=|v_ULTIMATE.start_cstrpbrk_#t~mem7_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_20|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_6|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_#t~mem7, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset] 384#L15-4 292.22/254.85 [2019-03-28 12:47:39,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.85 [2019-03-28 12:47:39,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1823859665, now seen corresponding path program 1 times 292.22/254.85 [2019-03-28 12:47:39,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.85 [2019-03-28 12:47:39,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.85 [2019-03-28 12:47:39,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:39,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:39,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 292.22/254.85 [2019-03-28 12:47:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 292.22/254.85 [2019-03-28 12:47:39,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.85 [2019-03-28 12:47:39,212 INFO L82 PathProgramCache]: Analyzing trace with hash 2065085536, now seen corresponding path program 3 times 292.22/254.85 [2019-03-28 12:47:39,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.85 [2019-03-28 12:47:39,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.85 [2019-03-28 12:47:39,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:39,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:39,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 292.22/254.85 [2019-03-28 12:47:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 292.22/254.85 [2019-03-28 12:47:39,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.85 [2019-03-28 12:47:39,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1098518770, now seen corresponding path program 1 times 292.22/254.85 [2019-03-28 12:47:39,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.85 [2019-03-28 12:47:39,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.85 [2019-03-28 12:47:39,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:39,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:39,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 292.22/254.85 [2019-03-28 12:47:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 292.22/254.85 [2019-03-28 12:47:39,345 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 292.22/254.85 [2019-03-28 12:47:39,591 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 292.22/254.85 [2019-03-28 12:47:39,695 INFO L216 LassoAnalysis]: Preferences: 292.22/254.85 [2019-03-28 12:47:39,696 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 292.22/254.85 [2019-03-28 12:47:39,696 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 292.22/254.85 [2019-03-28 12:47:39,696 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 292.22/254.85 [2019-03-28 12:47:39,696 INFO L127 ssoRankerPreferences]: Use exernal solver: false 292.22/254.85 [2019-03-28 12:47:39,697 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 292.22/254.85 [2019-03-28 12:47:39,697 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 292.22/254.85 [2019-03-28 12:47:39,697 INFO L130 ssoRankerPreferences]: Path of dumped script: 292.22/254.85 [2019-03-28 12:47:39,697 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 292.22/254.85 [2019-03-28 12:47:39,697 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 292.22/254.85 [2019-03-28 12:47:39,697 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 292.22/254.85 [2019-03-28 12:47:39,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.85 [2019-03-28 12:47:39,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.85 [2019-03-28 12:47:39,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.85 [2019-03-28 12:47:39,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.85 [2019-03-28 12:47:39,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.85 [2019-03-28 12:47:39,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.85 [2019-03-28 12:47:39,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.85 [2019-03-28 12:47:39,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.85 [2019-03-28 12:47:39,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.85 [2019-03-28 12:47:39,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.85 [2019-03-28 12:47:39,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.85 [2019-03-28 12:47:39,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.85 [2019-03-28 12:47:39,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.85 [2019-03-28 12:47:39,997 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 292.22/254.85 [2019-03-28 12:47:40,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.85 [2019-03-28 12:47:40,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.85 [2019-03-28 12:47:40,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.85 [2019-03-28 12:47:40,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.85 [2019-03-28 12:47:40,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.85 [2019-03-28 12:47:40,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.85 [2019-03-28 12:47:40,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.85 [2019-03-28 12:47:40,486 INFO L300 LassoAnalysis]: Preprocessing complete. 292.22/254.85 [2019-03-28 12:47:40,491 INFO L497 LassoAnalysis]: Using template 'affine'. 292.22/254.85 [2019-03-28 12:47:40,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.85 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.85 Number of strict supporting invariants: 0 292.22/254.85 Number of non-strict supporting invariants: 1 292.22/254.85 Consider only non-deceasing supporting invariants: true 292.22/254.85 Simplify termination arguments: true 292.22/254.85 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.85 [2019-03-28 12:47:40,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.85 [2019-03-28 12:47:40,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.85 [2019-03-28 12:47:40,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.85 [2019-03-28 12:47:40,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.85 [2019-03-28 12:47:40,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.85 [2019-03-28 12:47:40,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.85 [2019-03-28 12:47:40,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.85 [2019-03-28 12:47:40,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.85 [2019-03-28 12:47:40,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.85 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.85 Number of strict supporting invariants: 0 292.22/254.85 Number of non-strict supporting invariants: 1 292.22/254.85 Consider only non-deceasing supporting invariants: true 292.22/254.85 Simplify termination arguments: true 292.22/254.85 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.85 [2019-03-28 12:47:40,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.85 [2019-03-28 12:47:40,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.85 [2019-03-28 12:47:40,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.85 [2019-03-28 12:47:40,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.85 [2019-03-28 12:47:40,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.85 [2019-03-28 12:47:40,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.85 [2019-03-28 12:47:40,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.85 [2019-03-28 12:47:40,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.85 [2019-03-28 12:47:40,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.85 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.85 Number of strict supporting invariants: 0 292.22/254.85 Number of non-strict supporting invariants: 1 292.22/254.85 Consider only non-deceasing supporting invariants: true 292.22/254.85 Simplify termination arguments: true 292.22/254.85 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.85 [2019-03-28 12:47:40,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.85 [2019-03-28 12:47:40,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.85 [2019-03-28 12:47:40,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.85 [2019-03-28 12:47:40,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.85 [2019-03-28 12:47:40,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.85 [2019-03-28 12:47:40,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.85 [2019-03-28 12:47:40,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.85 [2019-03-28 12:47:40,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.85 [2019-03-28 12:47:40,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.85 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.85 Number of strict supporting invariants: 0 292.22/254.85 Number of non-strict supporting invariants: 1 292.22/254.85 Consider only non-deceasing supporting invariants: true 292.22/254.85 Simplify termination arguments: true 292.22/254.85 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.85 [2019-03-28 12:47:40,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.85 [2019-03-28 12:47:40,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.85 [2019-03-28 12:47:40,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.85 [2019-03-28 12:47:40,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.85 [2019-03-28 12:47:40,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.85 [2019-03-28 12:47:40,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.85 [2019-03-28 12:47:40,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.85 [2019-03-28 12:47:40,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.85 [2019-03-28 12:47:40,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.85 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.85 Number of strict supporting invariants: 0 292.22/254.85 Number of non-strict supporting invariants: 1 292.22/254.85 Consider only non-deceasing supporting invariants: true 292.22/254.85 Simplify termination arguments: true 292.22/254.85 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.85 [2019-03-28 12:47:40,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.85 [2019-03-28 12:47:40,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.85 [2019-03-28 12:47:40,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.85 [2019-03-28 12:47:40,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.85 [2019-03-28 12:47:40,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 292.22/254.85 [2019-03-28 12:47:40,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 292.22/254.85 [2019-03-28 12:47:40,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.85 [2019-03-28 12:47:40,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.85 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.85 Number of strict supporting invariants: 0 292.22/254.85 Number of non-strict supporting invariants: 1 292.22/254.85 Consider only non-deceasing supporting invariants: true 292.22/254.85 Simplify termination arguments: true 292.22/254.85 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.85 [2019-03-28 12:47:40,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.85 [2019-03-28 12:47:40,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.85 [2019-03-28 12:47:40,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.85 [2019-03-28 12:47:40,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.85 [2019-03-28 12:47:40,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.85 [2019-03-28 12:47:40,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.85 [2019-03-28 12:47:40,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.85 [2019-03-28 12:47:40,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.85 [2019-03-28 12:47:40,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.85 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.85 Number of strict supporting invariants: 0 292.22/254.85 Number of non-strict supporting invariants: 1 292.22/254.85 Consider only non-deceasing supporting invariants: true 292.22/254.85 Simplify termination arguments: true 292.22/254.85 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.85 [2019-03-28 12:47:40,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.85 [2019-03-28 12:47:40,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.85 [2019-03-28 12:47:40,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.85 [2019-03-28 12:47:40,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.85 [2019-03-28 12:47:40,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.85 [2019-03-28 12:47:40,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.85 [2019-03-28 12:47:40,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.85 [2019-03-28 12:47:40,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.85 [2019-03-28 12:47:40,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.85 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.85 Number of strict supporting invariants: 0 292.22/254.85 Number of non-strict supporting invariants: 1 292.22/254.85 Consider only non-deceasing supporting invariants: true 292.22/254.85 Simplify termination arguments: true 292.22/254.85 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.85 [2019-03-28 12:47:40,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.85 [2019-03-28 12:47:40,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.85 [2019-03-28 12:47:40,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.85 [2019-03-28 12:47:40,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.85 [2019-03-28 12:47:40,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.85 [2019-03-28 12:47:40,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.85 [2019-03-28 12:47:40,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.85 [2019-03-28 12:47:40,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.85 [2019-03-28 12:47:40,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.85 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.85 Number of strict supporting invariants: 0 292.22/254.85 Number of non-strict supporting invariants: 1 292.22/254.85 Consider only non-deceasing supporting invariants: true 292.22/254.85 Simplify termination arguments: true 292.22/254.85 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.85 [2019-03-28 12:47:40,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.85 [2019-03-28 12:47:40,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.85 [2019-03-28 12:47:40,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.85 [2019-03-28 12:47:40,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.85 [2019-03-28 12:47:40,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.85 [2019-03-28 12:47:40,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.85 [2019-03-28 12:47:40,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.85 [2019-03-28 12:47:40,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.85 [2019-03-28 12:47:40,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.85 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.85 Number of strict supporting invariants: 0 292.22/254.85 Number of non-strict supporting invariants: 1 292.22/254.85 Consider only non-deceasing supporting invariants: true 292.22/254.85 Simplify termination arguments: true 292.22/254.85 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.85 [2019-03-28 12:47:40,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.85 [2019-03-28 12:47:40,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.85 [2019-03-28 12:47:40,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.85 [2019-03-28 12:47:40,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.85 [2019-03-28 12:47:40,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.85 [2019-03-28 12:47:40,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.85 [2019-03-28 12:47:40,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.85 [2019-03-28 12:47:40,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.85 [2019-03-28 12:47:40,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.85 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.85 Number of strict supporting invariants: 0 292.22/254.85 Number of non-strict supporting invariants: 1 292.22/254.85 Consider only non-deceasing supporting invariants: true 292.22/254.85 Simplify termination arguments: true 292.22/254.85 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.85 [2019-03-28 12:47:40,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.85 [2019-03-28 12:47:40,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.85 [2019-03-28 12:47:40,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.85 [2019-03-28 12:47:40,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.85 [2019-03-28 12:47:40,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.85 [2019-03-28 12:47:40,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.85 [2019-03-28 12:47:40,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.85 [2019-03-28 12:47:40,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.85 [2019-03-28 12:47:40,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.85 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.85 Number of strict supporting invariants: 0 292.22/254.85 Number of non-strict supporting invariants: 1 292.22/254.85 Consider only non-deceasing supporting invariants: true 292.22/254.85 Simplify termination arguments: true 292.22/254.85 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.85 [2019-03-28 12:47:40,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.85 [2019-03-28 12:47:40,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.85 [2019-03-28 12:47:40,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.85 [2019-03-28 12:47:40,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.85 [2019-03-28 12:47:40,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.85 [2019-03-28 12:47:40,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.85 [2019-03-28 12:47:40,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.85 [2019-03-28 12:47:40,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.85 [2019-03-28 12:47:40,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.85 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.85 Number of strict supporting invariants: 0 292.22/254.85 Number of non-strict supporting invariants: 1 292.22/254.85 Consider only non-deceasing supporting invariants: true 292.22/254.85 Simplify termination arguments: true 292.22/254.85 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.85 [2019-03-28 12:47:40,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.85 [2019-03-28 12:47:40,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.85 [2019-03-28 12:47:40,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.85 [2019-03-28 12:47:40,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.85 [2019-03-28 12:47:40,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.85 [2019-03-28 12:47:40,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.85 [2019-03-28 12:47:40,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.85 [2019-03-28 12:47:40,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.85 [2019-03-28 12:47:40,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.85 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.85 Number of strict supporting invariants: 0 292.22/254.85 Number of non-strict supporting invariants: 1 292.22/254.85 Consider only non-deceasing supporting invariants: true 292.22/254.85 Simplify termination arguments: true 292.22/254.85 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.85 [2019-03-28 12:47:40,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.85 [2019-03-28 12:47:40,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.85 [2019-03-28 12:47:40,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.85 [2019-03-28 12:47:40,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.85 [2019-03-28 12:47:40,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 292.22/254.85 [2019-03-28 12:47:40,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 292.22/254.85 [2019-03-28 12:47:40,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.85 [2019-03-28 12:47:40,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.85 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.85 Number of strict supporting invariants: 0 292.22/254.85 Number of non-strict supporting invariants: 1 292.22/254.85 Consider only non-deceasing supporting invariants: true 292.22/254.85 Simplify termination arguments: true 292.22/254.85 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.85 [2019-03-28 12:47:40,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.85 [2019-03-28 12:47:40,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.85 [2019-03-28 12:47:40,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.85 [2019-03-28 12:47:40,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.85 [2019-03-28 12:47:40,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 292.22/254.85 [2019-03-28 12:47:40,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 292.22/254.85 [2019-03-28 12:47:40,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.85 [2019-03-28 12:47:40,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.85 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.85 Number of strict supporting invariants: 0 292.22/254.85 Number of non-strict supporting invariants: 1 292.22/254.85 Consider only non-deceasing supporting invariants: true 292.22/254.85 Simplify termination arguments: true 292.22/254.85 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.85 [2019-03-28 12:47:40,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.85 [2019-03-28 12:47:40,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.85 [2019-03-28 12:47:40,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.85 [2019-03-28 12:47:40,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.85 [2019-03-28 12:47:40,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 292.22/254.85 [2019-03-28 12:47:40,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 292.22/254.85 [2019-03-28 12:47:40,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.85 [2019-03-28 12:47:40,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.85 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.85 Number of strict supporting invariants: 0 292.22/254.85 Number of non-strict supporting invariants: 1 292.22/254.85 Consider only non-deceasing supporting invariants: true 292.22/254.85 Simplify termination arguments: true 292.22/254.85 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.85 [2019-03-28 12:47:40,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.85 [2019-03-28 12:47:40,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.85 [2019-03-28 12:47:40,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.85 [2019-03-28 12:47:40,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.85 [2019-03-28 12:47:40,564 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 292.22/254.85 [2019-03-28 12:47:40,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 292.22/254.85 [2019-03-28 12:47:40,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.85 [2019-03-28 12:47:40,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.85 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.85 Number of strict supporting invariants: 0 292.22/254.85 Number of non-strict supporting invariants: 1 292.22/254.85 Consider only non-deceasing supporting invariants: true 292.22/254.85 Simplify termination arguments: true 292.22/254.85 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.85 [2019-03-28 12:47:40,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.85 [2019-03-28 12:47:40,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.85 [2019-03-28 12:47:40,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.85 [2019-03-28 12:47:40,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.85 [2019-03-28 12:47:40,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 292.22/254.85 [2019-03-28 12:47:40,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 292.22/254.85 [2019-03-28 12:47:40,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.85 [2019-03-28 12:47:40,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.85 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.85 Number of strict supporting invariants: 0 292.22/254.85 Number of non-strict supporting invariants: 1 292.22/254.85 Consider only non-deceasing supporting invariants: true 292.22/254.85 Simplify termination arguments: true 292.22/254.85 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.85 [2019-03-28 12:47:40,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.85 [2019-03-28 12:47:40,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.85 [2019-03-28 12:47:40,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.85 [2019-03-28 12:47:40,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.85 [2019-03-28 12:47:40,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.85 [2019-03-28 12:47:40,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.85 [2019-03-28 12:47:40,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.85 [2019-03-28 12:47:40,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.85 [2019-03-28 12:47:40,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.85 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.85 Number of strict supporting invariants: 0 292.22/254.85 Number of non-strict supporting invariants: 1 292.22/254.85 Consider only non-deceasing supporting invariants: true 292.22/254.85 Simplify termination arguments: true 292.22/254.85 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.85 [2019-03-28 12:47:40,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.85 [2019-03-28 12:47:40,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.85 [2019-03-28 12:47:40,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.85 [2019-03-28 12:47:40,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.85 [2019-03-28 12:47:40,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 292.22/254.85 [2019-03-28 12:47:40,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 292.22/254.85 [2019-03-28 12:47:40,591 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 292.22/254.85 [2019-03-28 12:47:40,607 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 292.22/254.85 [2019-03-28 12:47:40,607 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. 292.22/254.85 [2019-03-28 12:47:40,610 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 292.22/254.85 [2019-03-28 12:47:40,611 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 292.22/254.85 [2019-03-28 12:47:40,611 INFO L518 LassoAnalysis]: Proved termination. 292.22/254.85 [2019-03-28 12:47:40,612 INFO L520 LassoAnalysis]: Termination argument consisting of: 292.22/254.85 Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1, ULTIMATE.start_cstrpbrk_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1 - 1*ULTIMATE.start_cstrpbrk_~sc1~0.offset 292.22/254.85 Supporting invariants [] 292.22/254.85 [2019-03-28 12:47:40,648 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed 292.22/254.85 [2019-03-28 12:47:40,652 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.85 [2019-03-28 12:47:40,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.85 [2019-03-28 12:47:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.85 [2019-03-28 12:47:40,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core 292.22/254.85 [2019-03-28 12:47:40,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... 292.22/254.85 [2019-03-28 12:47:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.85 [2019-03-28 12:47:40,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core 292.22/254.85 [2019-03-28 12:47:40,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... 292.22/254.85 [2019-03-28 12:47:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.85 [2019-03-28 12:47:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.85 [2019-03-28 12:47:40,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core 292.22/254.85 [2019-03-28 12:47:40,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... 292.22/254.85 [2019-03-28 12:47:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.85 [2019-03-28 12:47:40,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core 292.22/254.85 [2019-03-28 12:47:40,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... 292.22/254.85 [2019-03-28 12:47:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.85 [2019-03-28 12:47:40,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core 292.22/254.85 [2019-03-28 12:47:40,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... 292.22/254.85 [2019-03-28 12:47:40,881 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization 292.22/254.85 [2019-03-28 12:47:40,885 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates 292.22/254.85 [2019-03-28 12:47:40,886 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 61 states and 128 transitions. cyclomatic complexity: 70 Second operand 4 states. 292.22/254.85 [2019-03-28 12:47:41,045 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 61 states and 128 transitions. cyclomatic complexity: 70. Second operand 4 states. Result 104 states and 227 transitions. Complement of second has 5 states. 292.22/254.85 [2019-03-28 12:47:41,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states 292.22/254.85 [2019-03-28 12:47:41,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 292.22/254.85 [2019-03-28 12:47:41,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. 292.22/254.85 [2019-03-28 12:47:41,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 6 letters. Loop has 10 letters. 292.22/254.85 [2019-03-28 12:47:41,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. 292.22/254.85 [2019-03-28 12:47:41,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 16 letters. Loop has 10 letters. 292.22/254.85 [2019-03-28 12:47:41,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. 292.22/254.85 [2019-03-28 12:47:41,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 6 letters. Loop has 20 letters. 292.22/254.85 [2019-03-28 12:47:41,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. 292.22/254.85 [2019-03-28 12:47:41,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 227 transitions. 292.22/254.85 [2019-03-28 12:47:41,058 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 27 292.22/254.85 [2019-03-28 12:47:41,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 89 states and 200 transitions. 292.22/254.85 [2019-03-28 12:47:41,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 292.22/254.85 [2019-03-28 12:47:41,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 292.22/254.85 [2019-03-28 12:47:41,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 200 transitions. 292.22/254.85 [2019-03-28 12:47:41,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 292.22/254.85 [2019-03-28 12:47:41,060 INFO L706 BuchiCegarLoop]: Abstraction has 89 states and 200 transitions. 292.22/254.85 [2019-03-28 12:47:41,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 200 transitions. 292.22/254.85 [2019-03-28 12:47:41,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 76. 292.22/254.85 [2019-03-28 12:47:41,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. 292.22/254.85 [2019-03-28 12:47:41,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 160 transitions. 292.22/254.85 [2019-03-28 12:47:41,063 INFO L729 BuchiCegarLoop]: Abstraction has 76 states and 160 transitions. 292.22/254.85 [2019-03-28 12:47:41,063 INFO L609 BuchiCegarLoop]: Abstraction has 76 states and 160 transitions. 292.22/254.85 [2019-03-28 12:47:41,063 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 292.22/254.85 [2019-03-28 12:47:41,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 160 transitions. 292.22/254.85 [2019-03-28 12:47:41,064 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 292.22/254.85 [2019-03-28 12:47:41,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 292.22/254.85 [2019-03-28 12:47:41,065 INFO L119 BuchiIsEmpty]: Starting construction of run 292.22/254.85 [2019-03-28 12:47:41,065 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 292.22/254.85 [2019-03-28 12:47:41,065 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 292.22/254.85 [2019-03-28 12:47:41,066 INFO L794 eck$LassoCheckResult]: Stem: 739#ULTIMATE.startENTRY [201] ULTIMATE.startENTRY-->L29: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 732#L29 [130] L29-->L29-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 733#L29-2 [131] L29-2-->L32-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 768#L32-1 [154] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1) |v_#valid_5|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) 0) (= |v_ULTIMATE.start_main_#t~malloc10.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc10.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (= |v_#length_3| (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_5|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc10.offset] 762#L37 [108] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_2| (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 759#L37-1 [202] L37-1-->L15-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13 v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_12, ULTIMATE.start_cstrpbrk_#in~s2.base=|v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|, ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_3, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13, #length=|v_#length_18|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start_cstrpbrk_#t~post6.base=|v_ULTIMATE.start_cstrpbrk_#t~post6.base_4|, ULTIMATE.start_cstrpbrk_#t~mem7=|v_ULTIMATE.start_cstrpbrk_#t~mem7_7|, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_6|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_7|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3, ULTIMATE.start_cstrpbrk_#t~post6.offset=|v_ULTIMATE.start_cstrpbrk_#t~post6.offset_4|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_15, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_~s~0.offset, ULTIMATE.start_cstrpbrk_#in~s2.base, ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#in~s1.base, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#in~s1.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start_cstrpbrk_#t~post6.base, ULTIMATE.start_cstrpbrk_#t~mem7, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem2, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, ULTIMATE.start_cstrpbrk_#t~post6.offset, #memory_int, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset] 755#L15-4 [120] L15-4-->L15-1: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7)) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7 1) (select |v_#length_10| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem1] 744#L15-1 [168] L15-1-->L17: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~s~0.offset_5 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (= v_ULTIMATE.start_cstrpbrk_~s~0.base_6 v_ULTIMATE.start_cstrpbrk_~s2.base_3) (< |v_ULTIMATE.start_cstrpbrk_#t~mem1_6| 0)) InVars {ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_6|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_6, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_~s~0.offset] 724#L17 [204] L17-->L18-8: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12 1) (select |v_#length_19| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= v_ULTIMATE.start_cstrpbrk_~c~0_8 (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_#t~mem2] 725#L18-8 292.22/254.85 [2019-03-28 12:47:41,066 INFO L796 eck$LassoCheckResult]: Loop: 725#L18-8 [100] L18-8-->L18-1: Formula: (and (= (select |v_#valid_19| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) 1) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_6 1) (select |v_#length_14| v_ULTIMATE.start_cstrpbrk_~s~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_6) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) v_ULTIMATE.start_cstrpbrk_~s~0.offset_6))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_2|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem3] 786#L18-1 [183] L18-1-->L18-2: Formula: (and (not |v_ULTIMATE.start_cstrpbrk_#t~short5_2|) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_3| 0)) InVars {ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_2|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5] 729#L18-2 [87] L18-2-->L18-6: Formula: (not |v_ULTIMATE.start_cstrpbrk_#t~short5_5|) InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_5|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_5|} AuxVars[] AssignedVars[] 745#L18-6 [104] L18-6-->L18-8: Formula: (and |v_ULTIMATE.start_cstrpbrk_#t~short5_9| (= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_11 1) v_ULTIMATE.start_cstrpbrk_~s~0.offset_10) (= v_ULTIMATE.start_cstrpbrk_~s~0.base_14 v_ULTIMATE.start_cstrpbrk_~s~0.base_13)) InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_9|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_14, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_11} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_8|, ULTIMATE.start_cstrpbrk_#t~post6.offset=|v_ULTIMATE.start_cstrpbrk_#t~post6.offset_2|, ULTIMATE.start_cstrpbrk_#t~post6.base=|v_ULTIMATE.start_cstrpbrk_#t~post6.base_2|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_13, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_5|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_5|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_10} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_#t~post6.offset, ULTIMATE.start_cstrpbrk_#t~post6.base, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_~s~0.offset] 725#L18-8 292.22/254.85 [2019-03-28 12:47:41,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.85 [2019-03-28 12:47:41,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1028102413, now seen corresponding path program 1 times 292.22/254.85 [2019-03-28 12:47:41,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.85 [2019-03-28 12:47:41,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.85 [2019-03-28 12:47:41,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:41,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:41,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 292.22/254.85 [2019-03-28 12:47:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 292.22/254.85 [2019-03-28 12:47:41,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.85 [2019-03-28 12:47:41,086 INFO L82 PathProgramCache]: Analyzing trace with hash 4081285, now seen corresponding path program 1 times 292.22/254.85 [2019-03-28 12:47:41,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.85 [2019-03-28 12:47:41,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.85 [2019-03-28 12:47:41,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:41,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:41,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.85 [2019-03-28 12:47:41,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.85 [2019-03-28 12:47:41,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 292.22/254.85 [2019-03-28 12:47:41,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 292.22/254.85 [2019-03-28 12:47:41,093 INFO L811 eck$LassoCheckResult]: loop already infeasible 292.22/254.85 [2019-03-28 12:47:41,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 292.22/254.85 [2019-03-28 12:47:41,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 292.22/254.85 [2019-03-28 12:47:41,094 INFO L87 Difference]: Start difference. First operand 76 states and 160 transitions. cyclomatic complexity: 88 Second operand 3 states. 292.22/254.85 [2019-03-28 12:47:41,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 292.22/254.85 [2019-03-28 12:47:41,142 INFO L93 Difference]: Finished difference Result 67 states and 114 transitions. 292.22/254.85 [2019-03-28 12:47:41,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 292.22/254.85 [2019-03-28 12:47:41,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 114 transitions. 292.22/254.85 [2019-03-28 12:47:41,147 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 292.22/254.85 [2019-03-28 12:47:41,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 39 states and 72 transitions. 292.22/254.85 [2019-03-28 12:47:41,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 292.22/254.85 [2019-03-28 12:47:41,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 292.22/254.85 [2019-03-28 12:47:41,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 72 transitions. 292.22/254.85 [2019-03-28 12:47:41,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 292.22/254.85 [2019-03-28 12:47:41,149 INFO L706 BuchiCegarLoop]: Abstraction has 39 states and 72 transitions. 292.22/254.85 [2019-03-28 12:47:41,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 72 transitions. 292.22/254.85 [2019-03-28 12:47:41,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. 292.22/254.85 [2019-03-28 12:47:41,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. 292.22/254.85 [2019-03-28 12:47:41,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 72 transitions. 292.22/254.85 [2019-03-28 12:47:41,151 INFO L729 BuchiCegarLoop]: Abstraction has 39 states and 72 transitions. 292.22/254.85 [2019-03-28 12:47:41,151 INFO L609 BuchiCegarLoop]: Abstraction has 39 states and 72 transitions. 292.22/254.85 [2019-03-28 12:47:41,151 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 292.22/254.85 [2019-03-28 12:47:41,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 72 transitions. 292.22/254.85 [2019-03-28 12:47:41,151 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 292.22/254.85 [2019-03-28 12:47:41,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 292.22/254.85 [2019-03-28 12:47:41,152 INFO L119 BuchiIsEmpty]: Starting construction of run 292.22/254.85 [2019-03-28 12:47:41,152 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 292.22/254.85 [2019-03-28 12:47:41,152 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 292.22/254.85 [2019-03-28 12:47:41,153 INFO L794 eck$LassoCheckResult]: Stem: 882#ULTIMATE.startENTRY [201] ULTIMATE.startENTRY-->L29: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 877#L29 [130] L29-->L29-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 868#L29-2 [131] L29-2-->L32-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 869#L32-1 [154] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1) |v_#valid_5|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) 0) (= |v_ULTIMATE.start_main_#t~malloc10.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc10.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (= |v_#length_3| (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc10.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_5|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc10.offset] 893#L37 [108] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_2| (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 892#L37-1 [202] L37-1-->L15-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13 v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_12, ULTIMATE.start_cstrpbrk_#in~s2.base=|v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|, ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_3, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13, #length=|v_#length_18|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start_cstrpbrk_#t~post6.base=|v_ULTIMATE.start_cstrpbrk_#t~post6.base_4|, ULTIMATE.start_cstrpbrk_#t~mem7=|v_ULTIMATE.start_cstrpbrk_#t~mem7_7|, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_6|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_7|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3, ULTIMATE.start_cstrpbrk_#t~post6.offset=|v_ULTIMATE.start_cstrpbrk_#t~post6.offset_4|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_15, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_~s~0.offset, ULTIMATE.start_cstrpbrk_#in~s2.base, ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#in~s1.base, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#in~s1.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start_cstrpbrk_#t~post6.base, ULTIMATE.start_cstrpbrk_#t~mem7, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem2, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, ULTIMATE.start_cstrpbrk_#t~post6.offset, #memory_int, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset] 891#L15-4 [120] L15-4-->L15-1: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7)) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7 1) (select |v_#length_10| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_7, #length=|v_#length_10|, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem1] 886#L15-1 [168] L15-1-->L17: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~s~0.offset_5 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (= v_ULTIMATE.start_cstrpbrk_~s~0.base_6 v_ULTIMATE.start_cstrpbrk_~s2.base_3) (< |v_ULTIMATE.start_cstrpbrk_#t~mem1_6| 0)) InVars {ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_6|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_6, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_~s~0.offset] 873#L17 [204] L17-->L18-8: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12 1) (select |v_#length_19| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= v_ULTIMATE.start_cstrpbrk_~c~0_8 (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_19|, ULTIMATE.start_cstrpbrk_#t~mem2=|v_ULTIMATE.start_cstrpbrk_#t~mem2_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_#t~mem2] 874#L18-8 292.22/254.85 [2019-03-28 12:47:41,153 INFO L796 eck$LassoCheckResult]: Loop: 874#L18-8 [100] L18-8-->L18-1: Formula: (and (= (select |v_#valid_19| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) 1) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_6 1) (select |v_#length_14| v_ULTIMATE.start_cstrpbrk_~s~0.base_7)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_6) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) v_ULTIMATE.start_cstrpbrk_~s~0.offset_6))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_2|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem3] 870#L18-1 [181] L18-1-->L18-2: Formula: (and (> |v_ULTIMATE.start_cstrpbrk_#t~mem3_3| 0) |v_ULTIMATE.start_cstrpbrk_#t~short5_2|) InVars {ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_2|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5] 871#L18-2 [86] L18-2-->L18-3: Formula: |v_ULTIMATE.start_cstrpbrk_#t~short5_3| InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_3|} AuxVars[] AssignedVars[] 895#L18-3 [83] L18-3-->L18-4: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_8) (= |v_ULTIMATE.start_cstrpbrk_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_cstrpbrk_~s~0.base_10) v_ULTIMATE.start_cstrpbrk_~s~0.offset_8)) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_8 1) (select |v_#length_16| v_ULTIMATE.start_cstrpbrk_~s~0.base_10)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_cstrpbrk_~s~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_10, #length=|v_#length_16|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_8, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_2|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_10, #length=|v_#length_16|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem4] 894#L18-4 [192] L18-4-->L18-6: Formula: (let ((.cse0 (mod v_ULTIMATE.start_cstrpbrk_~c~0_6 256))) (and (> |v_ULTIMATE.start_cstrpbrk_#t~mem4_3| (+ .cse0 (- 256))) (> .cse0 127) |v_ULTIMATE.start_cstrpbrk_#t~short5_4|)) InVars {ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_6, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_4|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_6, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5] 887#L18-6 [104] L18-6-->L18-8: Formula: (and |v_ULTIMATE.start_cstrpbrk_#t~short5_9| (= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_11 1) v_ULTIMATE.start_cstrpbrk_~s~0.offset_10) (= v_ULTIMATE.start_cstrpbrk_~s~0.base_14 v_ULTIMATE.start_cstrpbrk_~s~0.base_13)) InVars {ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_9|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_14, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_11} OutVars{ULTIMATE.start_cstrpbrk_#t~short5=|v_ULTIMATE.start_cstrpbrk_#t~short5_8|, ULTIMATE.start_cstrpbrk_#t~post6.offset=|v_ULTIMATE.start_cstrpbrk_#t~post6.offset_2|, ULTIMATE.start_cstrpbrk_#t~post6.base=|v_ULTIMATE.start_cstrpbrk_#t~post6.base_2|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_13, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_5|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_5|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_10} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short5, ULTIMATE.start_cstrpbrk_#t~post6.offset, ULTIMATE.start_cstrpbrk_#t~post6.base, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_~s~0.offset] 874#L18-8 292.22/254.85 [2019-03-28 12:47:41,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.85 [2019-03-28 12:47:41,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1028102413, now seen corresponding path program 2 times 292.22/254.85 [2019-03-28 12:47:41,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.85 [2019-03-28 12:47:41,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.85 [2019-03-28 12:47:41,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:41,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:41,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 292.22/254.85 [2019-03-28 12:47:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 292.22/254.85 [2019-03-28 12:47:41,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.85 [2019-03-28 12:47:41,170 INFO L82 PathProgramCache]: Analyzing trace with hash -374743369, now seen corresponding path program 1 times 292.22/254.85 [2019-03-28 12:47:41,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.85 [2019-03-28 12:47:41,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.85 [2019-03-28 12:47:41,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:41,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:41,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 292.22/254.85 [2019-03-28 12:47:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 292.22/254.85 [2019-03-28 12:47:41,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.85 [2019-03-28 12:47:41,177 INFO L82 PathProgramCache]: Analyzing trace with hash -370835773, now seen corresponding path program 1 times 292.22/254.85 [2019-03-28 12:47:41,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 292.22/254.85 [2019-03-28 12:47:41,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 292.22/254.85 [2019-03-28 12:47:41,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:41,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:41,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 292.22/254.85 [2019-03-28 12:47:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 292.22/254.85 [2019-03-28 12:47:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 292.22/254.85 [2019-03-28 12:47:41,673 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 292.22/254.85 [2019-03-28 12:47:41,801 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 89 292.22/254.85 [2019-03-28 12:47:41,802 INFO L216 LassoAnalysis]: Preferences: 292.22/254.85 [2019-03-28 12:47:41,803 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 292.22/254.85 [2019-03-28 12:47:41,803 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 292.22/254.85 [2019-03-28 12:47:41,803 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 292.22/254.85 [2019-03-28 12:47:41,803 INFO L127 ssoRankerPreferences]: Use exernal solver: false 292.22/254.85 [2019-03-28 12:47:41,803 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 292.22/254.85 [2019-03-28 12:47:41,803 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 292.22/254.85 [2019-03-28 12:47:41,803 INFO L130 ssoRankerPreferences]: Path of dumped script: 292.22/254.85 [2019-03-28 12:47:41,803 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Lasso 292.22/254.86 [2019-03-28 12:47:41,804 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 292.22/254.86 [2019-03-28 12:47:41,804 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 292.22/254.86 [2019-03-28 12:47:41,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.86 [2019-03-28 12:47:41,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.86 [2019-03-28 12:47:41,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.86 [2019-03-28 12:47:41,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.86 [2019-03-28 12:47:41,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.86 [2019-03-28 12:47:41,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.86 [2019-03-28 12:47:41,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.86 [2019-03-28 12:47:41,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.86 [2019-03-28 12:47:41,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.86 [2019-03-28 12:47:41,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.86 [2019-03-28 12:47:41,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.86 [2019-03-28 12:47:41,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.86 [2019-03-28 12:47:41,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.86 [2019-03-28 12:47:41,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.86 [2019-03-28 12:47:41,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.86 [2019-03-28 12:47:41,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.86 [2019-03-28 12:47:41,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.86 [2019-03-28 12:47:41,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.86 [2019-03-28 12:47:42,123 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 292.22/254.86 [2019-03-28 12:47:42,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.86 [2019-03-28 12:47:42,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 292.22/254.86 [2019-03-28 12:47:42,393 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 292.22/254.86 [2019-03-28 12:47:42,624 INFO L300 LassoAnalysis]: Preprocessing complete. 292.22/254.86 [2019-03-28 12:47:42,624 INFO L497 LassoAnalysis]: Using template 'affine'. 292.22/254.86 [2019-03-28 12:47:42,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.86 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.86 Number of strict supporting invariants: 0 292.22/254.86 Number of non-strict supporting invariants: 1 292.22/254.86 Consider only non-deceasing supporting invariants: true 292.22/254.86 Simplify termination arguments: true 292.22/254.86 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.86 [2019-03-28 12:47:42,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.86 [2019-03-28 12:47:42,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.86 [2019-03-28 12:47:42,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.86 [2019-03-28 12:47:42,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.86 [2019-03-28 12:47:42,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.86 [2019-03-28 12:47:42,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.86 [2019-03-28 12:47:42,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.86 [2019-03-28 12:47:42,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.86 [2019-03-28 12:47:42,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.86 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.86 Number of strict supporting invariants: 0 292.22/254.86 Number of non-strict supporting invariants: 1 292.22/254.86 Consider only non-deceasing supporting invariants: true 292.22/254.86 Simplify termination arguments: true 292.22/254.86 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.86 [2019-03-28 12:47:42,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.86 [2019-03-28 12:47:42,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.86 [2019-03-28 12:47:42,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.86 [2019-03-28 12:47:42,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.86 [2019-03-28 12:47:42,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.86 [2019-03-28 12:47:42,629 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.86 [2019-03-28 12:47:42,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.86 [2019-03-28 12:47:42,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.86 [2019-03-28 12:47:42,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.86 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.86 Number of strict supporting invariants: 0 292.22/254.86 Number of non-strict supporting invariants: 1 292.22/254.86 Consider only non-deceasing supporting invariants: true 292.22/254.86 Simplify termination arguments: true 292.22/254.86 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.86 [2019-03-28 12:47:42,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.86 [2019-03-28 12:47:42,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.86 [2019-03-28 12:47:42,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.86 [2019-03-28 12:47:42,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.86 [2019-03-28 12:47:42,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 292.22/254.86 [2019-03-28 12:47:42,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 292.22/254.86 [2019-03-28 12:47:42,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.86 [2019-03-28 12:47:42,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.86 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.86 Number of strict supporting invariants: 0 292.22/254.86 Number of non-strict supporting invariants: 1 292.22/254.86 Consider only non-deceasing supporting invariants: true 292.22/254.86 Simplify termination arguments: true 292.22/254.86 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.86 [2019-03-28 12:47:42,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.86 [2019-03-28 12:47:42,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.86 [2019-03-28 12:47:42,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.86 [2019-03-28 12:47:42,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.86 [2019-03-28 12:47:42,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.86 [2019-03-28 12:47:42,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.86 [2019-03-28 12:47:42,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.86 [2019-03-28 12:47:42,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.86 [2019-03-28 12:47:42,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.86 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.86 Number of strict supporting invariants: 0 292.22/254.86 Number of non-strict supporting invariants: 1 292.22/254.86 Consider only non-deceasing supporting invariants: true 292.22/254.86 Simplify termination arguments: true 292.22/254.86 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.86 [2019-03-28 12:47:42,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.86 [2019-03-28 12:47:42,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.86 [2019-03-28 12:47:42,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.86 [2019-03-28 12:47:42,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.86 [2019-03-28 12:47:42,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.86 [2019-03-28 12:47:42,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.86 [2019-03-28 12:47:42,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.86 [2019-03-28 12:47:42,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.86 [2019-03-28 12:47:42,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.86 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.86 Number of strict supporting invariants: 0 292.22/254.86 Number of non-strict supporting invariants: 1 292.22/254.86 Consider only non-deceasing supporting invariants: true 292.22/254.86 Simplify termination arguments: true 292.22/254.86 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.86 [2019-03-28 12:47:42,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.86 [2019-03-28 12:47:42,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.86 [2019-03-28 12:47:42,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.86 [2019-03-28 12:47:42,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.86 [2019-03-28 12:47:42,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.86 [2019-03-28 12:47:42,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.86 [2019-03-28 12:47:42,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.86 [2019-03-28 12:47:42,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.86 [2019-03-28 12:47:42,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.86 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.86 Number of strict supporting invariants: 0 292.22/254.86 Number of non-strict supporting invariants: 1 292.22/254.86 Consider only non-deceasing supporting invariants: true 292.22/254.86 Simplify termination arguments: true 292.22/254.86 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.86 [2019-03-28 12:47:42,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.86 [2019-03-28 12:47:42,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.86 [2019-03-28 12:47:42,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.86 [2019-03-28 12:47:42,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.86 [2019-03-28 12:47:42,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.86 [2019-03-28 12:47:42,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.86 [2019-03-28 12:47:42,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.86 [2019-03-28 12:47:42,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.86 [2019-03-28 12:47:42,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.86 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.86 Number of strict supporting invariants: 0 292.22/254.86 Number of non-strict supporting invariants: 1 292.22/254.86 Consider only non-deceasing supporting invariants: true 292.22/254.86 Simplify termination arguments: true 292.22/254.86 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.86 [2019-03-28 12:47:42,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.86 [2019-03-28 12:47:42,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.86 [2019-03-28 12:47:42,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.86 [2019-03-28 12:47:42,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.86 [2019-03-28 12:47:42,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.86 [2019-03-28 12:47:42,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.86 [2019-03-28 12:47:42,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.86 [2019-03-28 12:47:42,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.86 [2019-03-28 12:47:42,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.86 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.86 Number of strict supporting invariants: 0 292.22/254.86 Number of non-strict supporting invariants: 1 292.22/254.86 Consider only non-deceasing supporting invariants: true 292.22/254.86 Simplify termination arguments: true 292.22/254.86 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.86 [2019-03-28 12:47:42,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.86 [2019-03-28 12:47:42,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.86 [2019-03-28 12:47:42,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.86 [2019-03-28 12:47:42,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.86 [2019-03-28 12:47:42,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.86 [2019-03-28 12:47:42,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.86 [2019-03-28 12:47:42,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.86 [2019-03-28 12:47:42,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.86 [2019-03-28 12:47:42,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.86 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.86 Number of strict supporting invariants: 0 292.22/254.86 Number of non-strict supporting invariants: 1 292.22/254.86 Consider only non-deceasing supporting invariants: true 292.22/254.86 Simplify termination arguments: true 292.22/254.86 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.86 [2019-03-28 12:47:42,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.86 [2019-03-28 12:47:42,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.86 [2019-03-28 12:47:42,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.86 [2019-03-28 12:47:42,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.86 [2019-03-28 12:47:42,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.86 [2019-03-28 12:47:42,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.86 [2019-03-28 12:47:42,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.86 [2019-03-28 12:47:42,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.86 [2019-03-28 12:47:42,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.86 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.86 Number of strict supporting invariants: 0 292.22/254.86 Number of non-strict supporting invariants: 1 292.22/254.86 Consider only non-deceasing supporting invariants: true 292.22/254.86 Simplify termination arguments: true 292.22/254.86 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.86 [2019-03-28 12:47:42,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.86 [2019-03-28 12:47:42,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.86 [2019-03-28 12:47:42,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.86 [2019-03-28 12:47:42,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.86 [2019-03-28 12:47:42,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.86 [2019-03-28 12:47:42,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.86 [2019-03-28 12:47:42,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.86 [2019-03-28 12:47:42,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.86 [2019-03-28 12:47:42,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.86 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.86 Number of strict supporting invariants: 0 292.22/254.86 Number of non-strict supporting invariants: 1 292.22/254.86 Consider only non-deceasing supporting invariants: true 292.22/254.86 Simplify termination arguments: true 292.22/254.86 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.86 [2019-03-28 12:47:42,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.86 [2019-03-28 12:47:42,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.86 [2019-03-28 12:47:42,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.86 [2019-03-28 12:47:42,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.86 [2019-03-28 12:47:42,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 292.22/254.86 [2019-03-28 12:47:42,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 292.22/254.86 [2019-03-28 12:47:42,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.86 [2019-03-28 12:47:42,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.86 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.86 Number of strict supporting invariants: 0 292.22/254.86 Number of non-strict supporting invariants: 1 292.22/254.86 Consider only non-deceasing supporting invariants: true 292.22/254.86 Simplify termination arguments: true 292.22/254.86 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.86 [2019-03-28 12:47:42,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.86 [2019-03-28 12:47:42,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.86 [2019-03-28 12:47:42,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.86 [2019-03-28 12:47:42,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.86 [2019-03-28 12:47:42,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.86 [2019-03-28 12:47:42,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.86 [2019-03-28 12:47:42,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.86 [2019-03-28 12:47:42,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.86 [2019-03-28 12:47:42,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.86 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.86 Number of strict supporting invariants: 0 292.22/254.86 Number of non-strict supporting invariants: 1 292.22/254.86 Consider only non-deceasing supporting invariants: true 292.22/254.86 Simplify termination arguments: true 292.22/254.86 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.86 [2019-03-28 12:47:42,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.86 [2019-03-28 12:47:42,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.86 [2019-03-28 12:47:42,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.86 [2019-03-28 12:47:42,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.86 [2019-03-28 12:47:42,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.86 [2019-03-28 12:47:42,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.86 [2019-03-28 12:47:42,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.86 [2019-03-28 12:47:42,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.86 [2019-03-28 12:47:42,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.86 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.86 Number of strict supporting invariants: 0 292.22/254.86 Number of non-strict supporting invariants: 1 292.22/254.86 Consider only non-deceasing supporting invariants: true 292.22/254.86 Simplify termination arguments: true 292.22/254.86 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.86 [2019-03-28 12:47:42,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.86 [2019-03-28 12:47:42,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.86 [2019-03-28 12:47:42,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.86 [2019-03-28 12:47:42,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.86 [2019-03-28 12:47:42,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.86 [2019-03-28 12:47:42,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.86 [2019-03-28 12:47:42,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.86 [2019-03-28 12:47:42,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.86 [2019-03-28 12:47:42,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.86 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.86 Number of strict supporting invariants: 0 292.22/254.86 Number of non-strict supporting invariants: 1 292.22/254.86 Consider only non-deceasing supporting invariants: true 292.22/254.86 Simplify termination arguments: true 292.22/254.86 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.86 [2019-03-28 12:47:42,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.86 [2019-03-28 12:47:42,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.86 [2019-03-28 12:47:42,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.86 [2019-03-28 12:47:42,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.86 [2019-03-28 12:47:42,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.86 [2019-03-28 12:47:42,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.86 [2019-03-28 12:47:42,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.86 [2019-03-28 12:47:42,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.86 [2019-03-28 12:47:42,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.86 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.86 Number of strict supporting invariants: 0 292.22/254.86 Number of non-strict supporting invariants: 1 292.22/254.86 Consider only non-deceasing supporting invariants: true 292.22/254.86 Simplify termination arguments: true 292.22/254.86 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.86 [2019-03-28 12:47:42,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.86 [2019-03-28 12:47:42,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.86 [2019-03-28 12:47:42,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.86 [2019-03-28 12:47:42,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.86 [2019-03-28 12:47:42,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.86 [2019-03-28 12:47:42,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.86 [2019-03-28 12:47:42,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.86 [2019-03-28 12:47:42,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.86 [2019-03-28 12:47:42,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.86 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.86 Number of strict supporting invariants: 0 292.22/254.86 Number of non-strict supporting invariants: 1 292.22/254.86 Consider only non-deceasing supporting invariants: true 292.22/254.86 Simplify termination arguments: true 292.22/254.86 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.86 [2019-03-28 12:47:42,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.86 [2019-03-28 12:47:42,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.86 [2019-03-28 12:47:42,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.86 [2019-03-28 12:47:42,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.86 [2019-03-28 12:47:42,665 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 292.22/254.86 [2019-03-28 12:47:42,665 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 292.22/254.86 [2019-03-28 12:47:42,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.86 [2019-03-28 12:47:42,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.86 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.86 Number of strict supporting invariants: 0 292.22/254.86 Number of non-strict supporting invariants: 1 292.22/254.86 Consider only non-deceasing supporting invariants: true 292.22/254.86 Simplify termination arguments: true 292.22/254.86 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.86 [2019-03-28 12:47:42,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.86 [2019-03-28 12:47:42,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 292.22/254.86 [2019-03-28 12:47:42,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.86 [2019-03-28 12:47:42,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.86 [2019-03-28 12:47:42,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.86 [2019-03-28 12:47:42,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 292.22/254.86 [2019-03-28 12:47:42,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 292.22/254.86 [2019-03-28 12:47:42,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.86 [2019-03-28 12:47:42,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.86 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.86 Number of strict supporting invariants: 0 292.22/254.86 Number of non-strict supporting invariants: 1 292.22/254.86 Consider only non-deceasing supporting invariants: true 292.22/254.86 Simplify termination arguments: true 292.22/254.86 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.86 [2019-03-28 12:47:42,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.86 [2019-03-28 12:47:42,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.86 [2019-03-28 12:47:42,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.86 [2019-03-28 12:47:42,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.86 [2019-03-28 12:47:42,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 292.22/254.86 [2019-03-28 12:47:42,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 292.22/254.86 [2019-03-28 12:47:42,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.86 [2019-03-28 12:47:42,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.86 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.86 Number of strict supporting invariants: 0 292.22/254.86 Number of non-strict supporting invariants: 1 292.22/254.86 Consider only non-deceasing supporting invariants: true 292.22/254.86 Simplify termination arguments: true 292.22/254.86 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.86 [2019-03-28 12:47:42,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.86 [2019-03-28 12:47:42,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.86 [2019-03-28 12:47:42,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.86 [2019-03-28 12:47:42,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.86 [2019-03-28 12:47:42,683 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 292.22/254.86 [2019-03-28 12:47:42,683 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 292.22/254.86 [2019-03-28 12:47:42,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.86 [2019-03-28 12:47:42,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.86 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.86 Number of strict supporting invariants: 0 292.22/254.86 Number of non-strict supporting invariants: 1 292.22/254.86 Consider only non-deceasing supporting invariants: true 292.22/254.86 Simplify termination arguments: true 292.22/254.86 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.86 [2019-03-28 12:47:42,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.86 [2019-03-28 12:47:42,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.86 [2019-03-28 12:47:42,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.86 [2019-03-28 12:47:42,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.86 [2019-03-28 12:47:42,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 292.22/254.86 [2019-03-28 12:47:42,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 292.22/254.86 [2019-03-28 12:47:42,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 292.22/254.86 [2019-03-28 12:47:42,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 292.22/254.86 Termination analysis: LINEAR_WITH_GUESSES 292.22/254.86 Number of strict supporting invariants: 0 292.22/254.86 Number of non-strict supporting invariants: 1 292.22/254.86 Consider only non-deceasing supporting invariants: true 292.22/254.86 Simplify termination arguments: true 292.22/254.86 Simplify supporting invariants: trueOverapproximate stem: false 292.22/254.86 [2019-03-28 12:47:42,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. 292.22/254.86 [2019-03-28 12:47:42,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 292.22/254.86 [2019-03-28 12:47:42,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 292.22/254.86 [2019-03-28 12:47:42,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 292.22/254.86 [2019-03-28 12:47:42,693 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 292.22/254.86 [2019-03-28 12:47:42,693 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 292.22/254.86 [2019-03-28 12:47:42,708 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 292.22/254.86 [2019-03-28 12:47:42,722 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 292.22/254.86 [2019-03-28 12:47:42,722 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. 292.22/254.86 [2019-03-28 12:47:42,723 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 292.22/254.86 [2019-03-28 12:47:42,723 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 292.22/254.86 [2019-03-28 12:47:42,724 INFO L518 LassoAnalysis]: Proved termination. 292.22/254.86 [2019-03-28 12:47:42,724 INFO L520 LassoAnalysis]: Termination argument consisting of: 292.22/254.86 Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_2) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_2 292.22/254.86 Supporting invariants [] 292.22/254.86 [2019-03-28 12:47:42,767 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed 292.22/254.86 [2019-03-28 12:47:42,769 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:42,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 292.22/254.86 [2019-03-28 12:47:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.86 [2019-03-28 12:47:42,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core 292.22/254.86 [2019-03-28 12:47:42,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... 292.22/254.86 [2019-03-28 12:47:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.86 [2019-03-28 12:47:42,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core 292.22/254.86 [2019-03-28 12:47:42,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... 292.22/254.86 [2019-03-28 12:47:42,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 292.22/254.86 [2019-03-28 12:47:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 292.22/254.86 [2019-03-28 12:47:42,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core 292.22/254.86 [2019-03-28 12:47:42,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... 292.22/254.86 [2019-03-28 12:47:42,986 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization 292.22/254.86 [2019-03-28 12:47:42,986 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 4 loop predicates 292.22/254.86 [2019-03-28 12:47:42,986 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 39 states and 72 transitions. cyclomatic complexity: 36 Second operand 6 states. 292.22/254.86 [2019-03-28 12:47:43,193 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 39 states and 72 transitions. cyclomatic complexity: 36. Second operand 6 states. Result 63 states and 120 transitions. Complement of second has 7 states. 292.22/254.86 [2019-03-28 12:47:43,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states 292.22/254.86 [2019-03-28 12:47:43,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 292.22/254.86 [2019-03-28 12:47:43,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. 292.22/254.86 [2019-03-28 12:47:43,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 9 letters. Loop has 6 letters. 292.22/254.86 [2019-03-28 12:47:43,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. 292.22/254.86 [2019-03-28 12:47:43,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 15 letters. Loop has 6 letters. 292.22/254.86 [2019-03-28 12:47:43,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. 292.22/254.86 [2019-03-28 12:47:43,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 9 letters. Loop has 12 letters. 292.22/254.86 [2019-03-28 12:47:43,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. 292.22/254.86 [2019-03-28 12:47:43,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 120 transitions. 292.22/254.86 [2019-03-28 12:47:43,199 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 292.22/254.86 [2019-03-28 12:47:43,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 0 states and 0 transitions. 292.22/254.86 [2019-03-28 12:47:43,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 292.22/254.86 [2019-03-28 12:47:43,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 292.22/254.86 [2019-03-28 12:47:43,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 292.22/254.86 [2019-03-28 12:47:43,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 292.22/254.86 [2019-03-28 12:47:43,200 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 292.22/254.86 [2019-03-28 12:47:43,200 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 292.22/254.86 [2019-03-28 12:47:43,200 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 292.22/254.86 [2019-03-28 12:47:43,200 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 292.22/254.86 [2019-03-28 12:47:43,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 292.22/254.86 [2019-03-28 12:47:43,201 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 292.22/254.86 [2019-03-28 12:47:43,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 292.22/254.86 [2019-03-28 12:47:43,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:47:43 BasicIcfg 292.22/254.86 [2019-03-28 12:47:43,207 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 292.22/254.86 [2019-03-28 12:47:43,207 INFO L168 Benchmark]: Toolchain (without parser) took 250429.27 ms. Allocated memory was 649.6 MB in the beginning and 832.6 MB in the end (delta: 183.0 MB). Free memory was 558.4 MB in the beginning and 616.6 MB in the end (delta: -58.2 MB). Peak memory consumption was 124.8 MB. Max. memory is 50.3 GB. 292.22/254.86 [2019-03-28 12:47:43,208 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 292.22/254.86 [2019-03-28 12:47:43,208 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.31 ms. Allocated memory was 649.6 MB in the beginning and 682.1 MB in the end (delta: 32.5 MB). Free memory was 558.4 MB in the beginning and 645.5 MB in the end (delta: -87.1 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. 292.22/254.86 [2019-03-28 12:47:43,209 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.47 ms. Allocated memory is still 682.1 MB. Free memory was 645.5 MB in the beginning and 644.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 292.22/254.86 [2019-03-28 12:47:43,209 INFO L168 Benchmark]: Boogie Preprocessor took 29.04 ms. Allocated memory is still 682.1 MB. Free memory was 644.1 MB in the beginning and 641.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 292.22/254.86 [2019-03-28 12:47:43,210 INFO L168 Benchmark]: RCFGBuilder took 358.64 ms. Allocated memory is still 682.1 MB. Free memory was 641.4 MB in the beginning and 614.7 MB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 50.3 GB. 292.22/254.86 [2019-03-28 12:47:43,210 INFO L168 Benchmark]: BlockEncodingV2 took 136.79 ms. Allocated memory is still 682.1 MB. Free memory was 614.7 MB in the beginning and 604.0 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 292.22/254.86 [2019-03-28 12:47:43,210 INFO L168 Benchmark]: TraceAbstraction took 243786.31 ms. Allocated memory was 682.1 MB in the beginning and 864.0 MB in the end (delta: 181.9 MB). Free memory was 602.6 MB in the beginning and 434.8 MB in the end (delta: 167.8 MB). Peak memory consumption was 433.4 MB. Max. memory is 50.3 GB. 292.22/254.86 [2019-03-28 12:47:43,211 INFO L168 Benchmark]: BuchiAutomizer took 5754.06 ms. Allocated memory was 864.0 MB in the beginning and 832.6 MB in the end (delta: -31.5 MB). Free memory was 434.8 MB in the beginning and 616.6 MB in the end (delta: -181.8 MB). There was no memory consumed. Max. memory is 50.3 GB. 292.22/254.86 [2019-03-28 12:47:43,214 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 292.22/254.86 --- Results --- 292.22/254.86 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 292.22/254.86 - StatisticsResult: Initial Icfg 292.22/254.86 40 locations, 47 edges 292.22/254.86 - StatisticsResult: Encoded RCFG 292.22/254.86 30 locations, 64 edges 292.22/254.86 * Results from de.uni_freiburg.informatik.ultimate.core: 292.22/254.86 - StatisticsResult: Toolchain Benchmarks 292.22/254.86 Benchmark results are: 292.22/254.86 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 292.22/254.86 * CACSL2BoogieTranslator took 313.31 ms. Allocated memory was 649.6 MB in the beginning and 682.1 MB in the end (delta: 32.5 MB). Free memory was 558.4 MB in the beginning and 645.5 MB in the end (delta: -87.1 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. 292.22/254.86 * Boogie Procedure Inliner took 45.47 ms. Allocated memory is still 682.1 MB. Free memory was 645.5 MB in the beginning and 644.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 292.22/254.86 * Boogie Preprocessor took 29.04 ms. Allocated memory is still 682.1 MB. Free memory was 644.1 MB in the beginning and 641.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 292.22/254.86 * RCFGBuilder took 358.64 ms. Allocated memory is still 682.1 MB. Free memory was 641.4 MB in the beginning and 614.7 MB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 50.3 GB. 292.22/254.86 * BlockEncodingV2 took 136.79 ms. Allocated memory is still 682.1 MB. Free memory was 614.7 MB in the beginning and 604.0 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 292.22/254.86 * TraceAbstraction took 243786.31 ms. Allocated memory was 682.1 MB in the beginning and 864.0 MB in the end (delta: 181.9 MB). Free memory was 602.6 MB in the beginning and 434.8 MB in the end (delta: 167.8 MB). Peak memory consumption was 433.4 MB. Max. memory is 50.3 GB. 292.22/254.86 * BuchiAutomizer took 5754.06 ms. Allocated memory was 864.0 MB in the beginning and 832.6 MB in the end (delta: -31.5 MB). Free memory was 434.8 MB in the beginning and 616.6 MB in the end (delta: -181.8 MB). There was no memory consumed. Max. memory is 50.3 GB. 292.22/254.86 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #memory_int 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 - GenericResult: Unfinished Backtranslation 292.22/254.86 unknown boogie variable #length 292.22/254.86 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 292.22/254.86 - PositiveResult [Line: 17]: pointer dereference always succeeds 292.22/254.86 For all program executions holds that pointer dereference always succeeds at this location 292.22/254.86 - PositiveResult [Line: 18]: pointer dereference always succeeds 292.22/254.86 For all program executions holds that pointer dereference always succeeds at this location 292.22/254.86 - PositiveResult [Line: 18]: pointer dereference always succeeds 292.22/254.86 For all program executions holds that pointer dereference always succeeds at this location 292.22/254.86 - PositiveResult [Line: 15]: pointer dereference always succeeds 292.22/254.86 For all program executions holds that pointer dereference always succeeds at this location 292.22/254.86 - PositiveResult [Line: 15]: pointer dereference always succeeds 292.22/254.86 For all program executions holds that pointer dereference always succeeds at this location 292.22/254.86 - PositiveResult [Line: 17]: pointer dereference always succeeds 292.22/254.86 For all program executions holds that pointer dereference always succeeds at this location 292.22/254.86 - PositiveResult [Line: 20]: pointer dereference always succeeds 292.22/254.86 For all program executions holds that pointer dereference always succeeds at this location 292.22/254.86 - PositiveResult [Line: 38]: pointer dereference always succeeds 292.22/254.86 For all program executions holds that pointer dereference always succeeds at this location 292.22/254.86 - PositiveResult [Line: 20]: pointer dereference always succeeds 292.22/254.86 For all program executions holds that pointer dereference always succeeds at this location 292.22/254.86 - PositiveResult [Line: 38]: pointer dereference always succeeds 292.22/254.86 For all program executions holds that pointer dereference always succeeds at this location 292.22/254.86 - PositiveResult [Line: 18]: pointer dereference always succeeds 292.22/254.86 For all program executions holds that pointer dereference always succeeds at this location 292.22/254.86 - PositiveResult [Line: 37]: pointer dereference always succeeds 292.22/254.86 For all program executions holds that pointer dereference always succeeds at this location 292.22/254.86 - PositiveResult [Line: 18]: pointer dereference always succeeds 292.22/254.86 For all program executions holds that pointer dereference always succeeds at this location 292.22/254.86 - PositiveResult [Line: 37]: pointer dereference always succeeds 292.22/254.86 For all program executions holds that pointer dereference always succeeds at this location 292.22/254.86 - AllSpecificationsHoldResult: All specifications hold 292.22/254.86 14 specifications checked. All of them hold 292.22/254.86 - InvariantResult [Line: 18]: Loop Invariant 292.22/254.86 [2019-03-28 12:47:43,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,234 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,234 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,234 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,234 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,235 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,235 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,235 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,235 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,239 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,239 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,239 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,239 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,239 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,240 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,240 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,240 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,243 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,243 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,243 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,243 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,244 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,244 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,244 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,244 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,245 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,245 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,245 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,245 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,245 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,246 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,247 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,247 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,248 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,248 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,248 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,248 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,248 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,249 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,249 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,249 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,249 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,250 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,250 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,250 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,250 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,251 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,251 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,251 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,251 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,251 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,252 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,252 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,252 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,253 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,253 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,253 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,253 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,253 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,254 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,254 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,254 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,254 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,254 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,255 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,255 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,255 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,255 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,256 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,256 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,256 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,256 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,257 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,257 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,257 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,257 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,258 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,258 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,258 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,258 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,259 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,259 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,259 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,259 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,260 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,260 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,260 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,260 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,261 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,261 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,261 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,261 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,261 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,262 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,262 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,262 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,266 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,266 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,266 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,266 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,266 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,267 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,267 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,267 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,267 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,267 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,268 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,268 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,268 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,268 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,271 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,271 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,271 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,271 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,272 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,272 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,272 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,272 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,273 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,273 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,273 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,275 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,275 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,275 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,275 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,275 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,276 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,277 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,277 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,277 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,279 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,279 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,279 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,279 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,280 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,280 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,280 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,280 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,280 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,281 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,281 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,281 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,281 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,283 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,283 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,283 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,283 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,283 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,284 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,284 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,284 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,284 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,284 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,285 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,285 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,285 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,285 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,286 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,286 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,286 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,287 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,287 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,287 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,287 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,287 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,288 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,288 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,288 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,288 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,289 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,289 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,289 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,290 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,290 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,290 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,290 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,291 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,291 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,291 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,291 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,291 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,291 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,292 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,292 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 Derived loop invariant: (((((0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1] && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && unknown-#memory_int-unknown[sc1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[sc1] + -1] == 0)) && !(nondetString1 == nondetString2)) && (((((0 == sc1 && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s2] + -1] == 0)) && s + 1 <= unknown-#length-unknown[s]) && (((((((((((((!(c == 0) && s2 == 0) && 1 <= s) && length1 == unknown-#length-unknown[nondetString1]) && \valid[s] == 1) && !(0 == unknown-#memory_int-unknown[sc1][sc1])) && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && 1 <= unknown-#length-unknown[s2]) && 1 == \valid[nondetString1]) && nondetString1 == 0) && 1 == \valid[s2]) && nondetString2 == 0) && \valid[sc1] == 1) && 1 == \valid[nondetString2]) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int, ULTIMATE.start_main_~length1~0 : int :: ((1 <= ULTIMATE.start_main_~length1~0 && sc1 <= ULTIMATE.start_main_~nondetString1~0.offset) && unknown-#memory_int-unknown[sc1][ULTIMATE.start_main_~nondetString1~0.offset + ULTIMATE.start_main_~length1~0 + -1] == 0) && ULTIMATE.start_main_~nondetString1~0.offset + ULTIMATE.start_main_~length1~0 <= unknown-#length-unknown[sc1])) && (\exists ULTIMATE.start_main_~length1~0 : int :: (1 <= ULTIMATE.start_main_~length1~0 && nondetString1 + ULTIMATE.start_main_~length1~0 <= unknown-#length-unknown[nondetString1]) && unknown-#memory_int-unknown[nondetString1][nondetString1 + ULTIMATE.start_main_~length1~0 + -1] == 0)) && unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1] == 0) && !(s2 == sc1)) || ((((((((((c == unknown-#memory_int-unknown[sc1][sc1] && 0 == sc1) && !(nondetString1 == nondetString2)) && (((((((((((s2 == 0 && length1 == unknown-#length-unknown[nondetString1]) && !(0 == unknown-#memory_int-unknown[sc1][sc1])) && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && 0 == s) && 1 == \valid[nondetString1]) && 1 <= unknown-#length-unknown[s]) && nondetString1 == 0) && 1 == \valid[s2]) && nondetString2 == 0) && \valid[sc1] == 1) && 1 == \valid[nondetString2]) && !(s2 == sc1)) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int, ULTIMATE.start_main_~length1~0 : int :: ((1 <= ULTIMATE.start_main_~length1~0 && sc1 <= ULTIMATE.start_main_~nondetString1~0.offset) && unknown-#memory_int-unknown[sc1][ULTIMATE.start_main_~nondetString1~0.offset + ULTIMATE.start_main_~length1~0 + -1] == 0) && ULTIMATE.start_main_~nondetString1~0.offset + ULTIMATE.start_main_~length1~0 <= unknown-#length-unknown[sc1])) && s == s2) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && unknown-#memory_int-unknown[sc1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[sc1] + -1] == 0)) && (\exists ULTIMATE.start_main_~length1~0 : int :: (1 <= ULTIMATE.start_main_~length1~0 && nondetString1 + ULTIMATE.start_main_~length1~0 <= unknown-#length-unknown[nondetString1]) && unknown-#memory_int-unknown[nondetString1][nondetString1 + ULTIMATE.start_main_~length1~0 + -1] == 0)) && unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1] == 0)) || (((((((((((((((((((((((((s2 == 0 && \valid[s] == 1) && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && 0 == s) && 1 <= sc1) && nondetString1 == 0) && 1 == \valid[s2]) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s2] + -1] == 0)) && sc1 + 1 <= unknown-#length-unknown[sc1]) && !(c == 0)) && \valid[nondetString2] == 1) && length1 == unknown-#length-unknown[nondetString1]) && !(nondetString1 == nondetString2)) && !(0 == unknown-#memory_int-unknown[sc1][sc1])) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((0 == unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1] && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[s2]) && s2 <= ULTIMATE.start_main_~nondetString2~0.offset) && 1 <= ULTIMATE.start_main_~length2~0)) && 1 == \valid[nondetString1]) && 1 <= unknown-#length-unknown[s]) && nondetString2 == 0) && \valid[sc1] == 1) && (\exists ULTIMATE.start_main_~length1~0 : int :: (1 <= ULTIMATE.start_main_~length1~0 && nondetString1 + ULTIMATE.start_main_~length1~0 <= unknown-#length-unknown[nondetString1]) && unknown-#memory_int-unknown[nondetString1][nondetString1 + ULTIMATE.start_main_~length1~0 + -1] == 0)) && unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1] == 0) || (((((((((((((((((((((s2 == 0 && \valid[s] == 1) && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && 1 <= sc1) && nondetString1 == 0) && 1 == \valid[s2]) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s2] + -1] == 0)) && sc1 + 1 <= unknown-#length-unknown[sc1]) && s + 1 <= unknown-#length-unknown[s]) && !(c == 0)) && \valid[nondetString2] == 1) && 1 <= s) && length1 == unknown-#length-unknown[nondetString1]) && !(nondetString1 == nondetString2)) && !(0 == unknown-#memory_int-unknown[sc1][sc1])) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((0 == unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1] && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[s2]) && s2 <= ULTIMATE.start_main_~nondetString2~0.offset) && 1 <= ULTIMATE.start_main_~length2~0)) && 1 == \valid[nondetString1]) && nondetString2 == 0) && \valid[sc1] == 1) && (\exists ULTIMATE.start_main_~length1~0 : int :: (1 <= ULTIMATE.start_main_~length1~0 && nondetString1 + ULTIMATE.start_main_~length1~0 <= unknown-#length-unknown[nondetString1]) && unknown-#memory_int-unknown[nondetString1][nondetString1 + ULTIMATE.start_main_~length1~0 + -1] == 0)) && unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1] == 0)) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && unknown-#memory_int-unknown[sc1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[sc1] + -1] == 0)) && !(s2 == sc1)) 292.22/254.86 - InvariantResult [Line: 15]: Loop Invariant 292.22/254.86 [2019-03-28 12:47:43,293 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,294 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,294 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,294 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,294 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,294 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,295 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,295 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,295 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,298 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,298 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,298 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,298 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,298 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,299 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,299 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,299 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,299 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,299 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,300 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,300 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,302 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,302 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,302 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,302 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,302 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,303 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,303 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,303 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,303 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,304 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,304 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,304 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,304 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,304 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,305 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,305 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,305 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,305 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,306 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,306 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,306 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,306 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,307 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,307 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,307 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,307 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,308 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,308 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,308 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,309 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,309 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,309 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,309 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,310 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,310 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,310 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,310 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,311 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,311 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,311 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,311 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,311 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,312 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,312 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,312 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,312 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,312 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,313 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,313 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,313 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,313 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,313 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,314 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,314 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,314 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,314 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 292.22/254.86 [2019-03-28 12:47:43,315 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,315 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,315 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,316 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,316 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,316 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,316 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,316 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,317 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,317 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,317 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,317 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,318 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,318 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,318 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,318 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,318 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,320 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,320 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,320 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,320 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,321 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,321 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,321 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 [2019-03-28 12:47:43,321 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,321 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 292.22/254.86 [2019-03-28 12:47:43,322 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 292.22/254.86 Derived loop invariant: ((((((((!(s2 == sc1) && s + 2 <= unknown-#length-unknown[s]) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && nondetString1 == 0) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && unknown-#memory_int-unknown[sc1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[sc1] + -1] == 0)) && nondetString2 == 0) && sc1 + 1 <= unknown-#length-unknown[sc1]) && (((1 <= sc1 && 1 <= length1) && !(nondetString1 == nondetString2)) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s2] + -1] == 0)) && (((((((((((!(c == 0) && s2 == 0) && 1 <= s) && length1 == unknown-#length-unknown[nondetString1]) && \valid[s] == 1) && unknown-#length-unknown[nondetString2] == length2) && 1 <= unknown-#length-unknown[s2]) && 1 == \valid[nondetString1]) && 1 == \valid[s2]) && \valid[sc1] == 1) && 1 == \valid[nondetString2]) || ((((((((((!(c == 0) && s2 == 0) && length1 == unknown-#length-unknown[nondetString1]) && \valid[s] == 1) && unknown-#length-unknown[nondetString2] == length2) && 0 == s) && 1 <= unknown-#length-unknown[s2]) && 1 == \valid[nondetString1]) && 1 == \valid[s2]) && \valid[sc1] == 1) && 1 == \valid[nondetString2])) && 1 <= length2) && unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1] == 0) || ((((((((((((((((((s2 == 0 && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && nondetString1 == 0) && 1 == \valid[s2]) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s2] + -1] == 0)) && \valid[nondetString2] == 1) && 0 == sc1) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[nondetString1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[nondetString1] + -1])) && length1 == unknown-#length-unknown[nondetString1]) && !(nondetString1 == nondetString2)) && !(s2 == sc1)) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int, ULTIMATE.start_main_~length1~0 : int :: ((1 <= ULTIMATE.start_main_~length1~0 && sc1 <= ULTIMATE.start_main_~nondetString1~0.offset) && unknown-#memory_int-unknown[sc1][ULTIMATE.start_main_~nondetString1~0.offset + ULTIMATE.start_main_~length1~0 + -1] == 0) && ULTIMATE.start_main_~nondetString1~0.offset + ULTIMATE.start_main_~length1~0 <= unknown-#length-unknown[sc1])) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((0 == unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1] && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[s2]) && s2 <= ULTIMATE.start_main_~nondetString2~0.offset) && 1 <= ULTIMATE.start_main_~length2~0)) && 1 == \valid[nondetString1]) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && unknown-#memory_int-unknown[sc1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[sc1] + -1] == 0)) && nondetString2 == 0) && \valid[sc1] == 1) && (\exists ULTIMATE.start_main_~length1~0 : int :: (1 <= ULTIMATE.start_main_~length1~0 && nondetString1 + ULTIMATE.start_main_~length1~0 <= unknown-#length-unknown[nondetString1]) && unknown-#memory_int-unknown[nondetString1][nondetString1 + ULTIMATE.start_main_~length1~0 + -1] == 0)) 292.22/254.86 - StatisticsResult: Ultimate Automizer benchmark data 292.22/254.86 CFG has 1 procedures, 30 locations, 14 error locations. SAFE Result, 243.5s OverallTime, 22 OverallIterations, 3 TraceHistogramMax, 234.8s AutomataDifference, 0.0s DeadEndRemovalTime, 3.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 187 SDtfs, 4432 SDslu, 885 SDs, 0 SdLazy, 2697 SolverSat, 443 SolverUnsat, 38 SolverUnknown, 0 SolverNotchecked, 194.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 400 GetRequests, 164 SyntacticMatches, 8 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1001 ImplicationChecksByTransitivity, 41.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 217 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 30 NumberOfFragments, 1167 HoareAnnotationTreeSize, 2 FomulaSimplifications, 92315 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 2 FomulaSimplificationsInter, 19429 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 480 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 450 ConstructedInterpolants, 69 QuantifiedInterpolants, 174972 SizeOfPredicates, 96 NumberOfNonLiveVariables, 1054 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 30 InterpolantComputations, 16 PerfectInterpolantSequences, 34/159 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 292.22/254.86 - StatisticsResult: Constructed decomposition of program 292.22/254.86 Your program was decomposed into 7 terminating modules (5 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function unknown-#length-unknown[alloca(length1 * sizeof(char))] + -1 * sc1 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[alloca(length2 * sizeof(char))] and consists of 6 locations. 5 modules have a trivial ranking function, the largest among these consists of 9 locations. 292.22/254.86 - StatisticsResult: Timing statistics 292.22/254.86 BüchiAutomizer plugin needed 5.7s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 3.8s. Construction of modules took 0.7s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 38 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 76 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 97 SDtfs, 629 SDslu, 415 SDs, 0 SdLazy, 946 SolverSat, 72 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital219 mio100 ax100 hnf100 lsp97 ukn78 mio100 lsp37 div111 bol100 ite100 ukn100 eq171 hnf88 smp94 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 292.22/254.86 - TerminationAnalysisResult: Termination proven 292.22/254.86 Buchi Automizer proved that your program is terminating 292.22/254.86 RESULT: Ultimate proved your program to be correct! 292.22/254.86 !SESSION 2019-03-28 12:43:29.529 ----------------------------------------------- 292.22/254.86 eclipse.buildId=unknown 292.22/254.86 java.version=1.8.0_181 292.22/254.86 java.vendor=Oracle Corporation 292.22/254.86 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 292.22/254.86 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 292.22/254.86 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c 292.22/254.86 292.22/254.86 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:47:43.559 292.22/254.86 !MESSAGE The workspace will exit with unsaved changes in this session. 292.22/254.86 Received shutdown request... 292.22/254.86 Ultimate: 292.22/254.86 GTK+ Version Check 292.22/254.86 EOF