28.94/14.51 YES 28.94/14.51 28.94/14.51 Ultimate: Cannot open display: 28.94/14.51 This is Ultimate 0.1.24-8dc7c08-m 28.94/14.51 [2019-03-28 12:39:00,418 INFO L170 SettingsManager]: Resetting all preferences to default values... 28.94/14.51 [2019-03-28 12:39:00,421 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 28.94/14.51 [2019-03-28 12:39:00,432 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 28.94/14.51 [2019-03-28 12:39:00,432 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 28.94/14.51 [2019-03-28 12:39:00,433 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 28.94/14.51 [2019-03-28 12:39:00,434 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 28.94/14.51 [2019-03-28 12:39:00,436 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 28.94/14.51 [2019-03-28 12:39:00,438 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 28.94/14.51 [2019-03-28 12:39:00,438 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 28.94/14.51 [2019-03-28 12:39:00,439 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 28.94/14.51 [2019-03-28 12:39:00,439 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 28.94/14.51 [2019-03-28 12:39:00,440 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 28.94/14.51 [2019-03-28 12:39:00,441 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 28.94/14.51 [2019-03-28 12:39:00,442 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 28.94/14.51 [2019-03-28 12:39:00,443 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 28.94/14.51 [2019-03-28 12:39:00,444 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 28.94/14.51 [2019-03-28 12:39:00,445 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 28.94/14.51 [2019-03-28 12:39:00,447 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 28.94/14.51 [2019-03-28 12:39:00,449 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 28.94/14.51 [2019-03-28 12:39:00,450 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 28.94/14.51 [2019-03-28 12:39:00,451 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 28.94/14.51 [2019-03-28 12:39:00,453 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 28.94/14.51 [2019-03-28 12:39:00,453 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 28.94/14.51 [2019-03-28 12:39:00,453 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 28.94/14.51 [2019-03-28 12:39:00,454 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 28.94/14.51 [2019-03-28 12:39:00,455 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 28.94/14.51 [2019-03-28 12:39:00,455 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 28.94/14.51 [2019-03-28 12:39:00,456 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 28.94/14.51 [2019-03-28 12:39:00,457 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 28.94/14.51 [2019-03-28 12:39:00,457 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 28.94/14.51 [2019-03-28 12:39:00,458 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 28.94/14.51 [2019-03-28 12:39:00,459 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 28.94/14.51 [2019-03-28 12:39:00,459 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 28.94/14.51 [2019-03-28 12:39:00,460 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 28.94/14.51 [2019-03-28 12:39:00,460 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 28.94/14.51 [2019-03-28 12:39:00,460 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 28.94/14.51 [2019-03-28 12:39:00,461 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 28.94/14.51 [2019-03-28 12:39:00,462 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 28.94/14.51 [2019-03-28 12:39:00,462 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 28.94/14.51 [2019-03-28 12:39:00,476 INFO L110 SettingsManager]: Loading preferences was successful 28.94/14.51 [2019-03-28 12:39:00,477 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 28.94/14.51 [2019-03-28 12:39:00,478 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 28.94/14.51 [2019-03-28 12:39:00,478 INFO L133 SettingsManager]: * Rewrite not-equals=true 28.94/14.51 [2019-03-28 12:39:00,478 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 28.94/14.51 [2019-03-28 12:39:00,478 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 28.94/14.51 [2019-03-28 12:39:00,479 INFO L133 SettingsManager]: * Use SBE=true 28.94/14.51 [2019-03-28 12:39:00,479 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 28.94/14.51 [2019-03-28 12:39:00,479 INFO L133 SettingsManager]: * Use old map elimination=false 28.94/14.51 [2019-03-28 12:39:00,479 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 28.94/14.51 [2019-03-28 12:39:00,479 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 28.94/14.51 [2019-03-28 12:39:00,480 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 28.94/14.51 [2019-03-28 12:39:00,480 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 28.94/14.51 [2019-03-28 12:39:00,480 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 28.94/14.51 [2019-03-28 12:39:00,480 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.94/14.51 [2019-03-28 12:39:00,480 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 28.94/14.51 [2019-03-28 12:39:00,481 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 28.94/14.51 [2019-03-28 12:39:00,481 INFO L133 SettingsManager]: * Check division by zero=IGNORE 28.94/14.51 [2019-03-28 12:39:00,481 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 28.94/14.51 [2019-03-28 12:39:00,481 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 28.94/14.51 [2019-03-28 12:39:00,481 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 28.94/14.51 [2019-03-28 12:39:00,482 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 28.94/14.51 [2019-03-28 12:39:00,482 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 28.94/14.51 [2019-03-28 12:39:00,482 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 28.94/14.51 [2019-03-28 12:39:00,482 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 28.94/14.51 [2019-03-28 12:39:00,482 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 28.94/14.51 [2019-03-28 12:39:00,483 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 28.94/14.51 [2019-03-28 12:39:00,483 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 28.94/14.51 [2019-03-28 12:39:00,483 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 28.94/14.51 [2019-03-28 12:39:00,508 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 28.94/14.51 [2019-03-28 12:39:00,521 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 28.94/14.51 [2019-03-28 12:39:00,525 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 28.94/14.51 [2019-03-28 12:39:00,526 INFO L271 PluginConnector]: Initializing CDTParser... 28.94/14.51 [2019-03-28 12:39:00,526 INFO L276 PluginConnector]: CDTParser initialized 28.94/14.51 [2019-03-28 12:39:00,527 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 28.94/14.51 [2019-03-28 12:39:00,585 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/136b535add3b4b6397c12461439b1f48/FLAG01a1302c4 28.94/14.51 [2019-03-28 12:39:00,928 INFO L307 CDTParser]: Found 1 translation units. 28.94/14.51 [2019-03-28 12:39:00,928 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 28.94/14.51 [2019-03-28 12:39:00,929 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 28.94/14.51 [2019-03-28 12:39:00,935 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/136b535add3b4b6397c12461439b1f48/FLAG01a1302c4 28.94/14.51 [2019-03-28 12:39:01,330 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/136b535add3b4b6397c12461439b1f48 28.94/14.51 [2019-03-28 12:39:01,341 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 28.94/14.51 [2019-03-28 12:39:01,343 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 28.94/14.51 [2019-03-28 12:39:01,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 28.94/14.51 [2019-03-28 12:39:01,344 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 28.94/14.51 [2019-03-28 12:39:01,348 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 28.94/14.51 [2019-03-28 12:39:01,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:39:01" (1/1) ... 28.94/14.51 [2019-03-28 12:39:01,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@386633ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:01, skipping insertion in model container 28.94/14.51 [2019-03-28 12:39:01,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:39:01" (1/1) ... 28.94/14.51 [2019-03-28 12:39:01,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 28.94/14.51 [2019-03-28 12:39:01,377 INFO L176 MainTranslator]: Built tables and reachable declarations 28.94/14.51 [2019-03-28 12:39:01,541 INFO L206 PostProcessor]: Analyzing one entry point: main 28.94/14.51 [2019-03-28 12:39:01,554 INFO L191 MainTranslator]: Completed pre-run 28.94/14.51 [2019-03-28 12:39:01,573 INFO L206 PostProcessor]: Analyzing one entry point: main 28.94/14.51 [2019-03-28 12:39:01,658 INFO L195 MainTranslator]: Completed translation 28.94/14.51 [2019-03-28 12:39:01,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:01 WrapperNode 28.94/14.51 [2019-03-28 12:39:01,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 28.94/14.51 [2019-03-28 12:39:01,659 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 28.94/14.51 [2019-03-28 12:39:01,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 28.94/14.51 [2019-03-28 12:39:01,660 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 28.94/14.51 [2019-03-28 12:39:01,670 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:39:01" (1/1) ... 28.94/14.51 [2019-03-28 12:39:01,680 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:39:01" (1/1) ... 28.94/14.51 [2019-03-28 12:39:01,705 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 28.94/14.51 [2019-03-28 12:39:01,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 28.94/14.51 [2019-03-28 12:39:01,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 28.94/14.51 [2019-03-28 12:39:01,706 INFO L276 PluginConnector]: Boogie Preprocessor initialized 28.94/14.51 [2019-03-28 12:39:01,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:01" (1/1) ... 28.94/14.51 [2019-03-28 12:39:01,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:01" (1/1) ... 28.94/14.51 [2019-03-28 12:39:01,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:01" (1/1) ... 28.94/14.51 [2019-03-28 12:39:01,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:01" (1/1) ... 28.94/14.51 [2019-03-28 12:39:01,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:01" (1/1) ... 28.94/14.51 [2019-03-28 12:39:01,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:01" (1/1) ... 28.94/14.51 [2019-03-28 12:39:01,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:01" (1/1) ... 28.94/14.51 [2019-03-28 12:39:01,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 28.94/14.51 [2019-03-28 12:39:01,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 28.94/14.51 [2019-03-28 12:39:01,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... 28.94/14.51 [2019-03-28 12:39:01,733 INFO L276 PluginConnector]: RCFGBuilder initialized 28.94/14.51 [2019-03-28 12:39:01,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:01" (1/1) ... 28.94/14.51 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.94/14.51 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 28.94/14.51 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 28.94/14.51 [2019-03-28 12:39:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 28.94/14.51 [2019-03-28 12:39:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 28.94/14.51 [2019-03-28 12:39:01,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 28.94/14.51 [2019-03-28 12:39:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 28.94/14.51 [2019-03-28 12:39:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 28.94/14.51 [2019-03-28 12:39:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 28.94/14.51 [2019-03-28 12:39:02,156 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 28.94/14.51 [2019-03-28 12:39:02,157 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 28.94/14.51 [2019-03-28 12:39:02,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:39:02 BoogieIcfgContainer 28.94/14.51 [2019-03-28 12:39:02,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 28.94/14.51 [2019-03-28 12:39:02,159 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 28.94/14.51 [2019-03-28 12:39:02,159 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 28.94/14.51 [2019-03-28 12:39:02,161 INFO L276 PluginConnector]: BlockEncodingV2 initialized 28.94/14.51 [2019-03-28 12:39:02,162 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:39:02" (1/1) ... 28.94/14.51 [2019-03-28 12:39:02,183 INFO L313 BlockEncoder]: Initial Icfg 52 locations, 55 edges 28.94/14.51 [2019-03-28 12:39:02,184 INFO L258 BlockEncoder]: Using Remove infeasible edges 28.94/14.51 [2019-03-28 12:39:02,185 INFO L263 BlockEncoder]: Using Maximize final states 28.94/14.51 [2019-03-28 12:39:02,186 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 28.94/14.51 [2019-03-28 12:39:02,186 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 28.94/14.51 [2019-03-28 12:39:02,188 INFO L296 BlockEncoder]: Using Remove sink states 28.94/14.51 [2019-03-28 12:39:02,189 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 28.94/14.51 [2019-03-28 12:39:02,189 INFO L179 BlockEncoder]: Using Rewrite not-equals 28.94/14.51 [2019-03-28 12:39:02,215 INFO L185 BlockEncoder]: Using Use SBE 28.94/14.51 [2019-03-28 12:39:02,252 INFO L200 BlockEncoder]: SBE split 27 edges 28.94/14.51 [2019-03-28 12:39:02,257 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 28.94/14.51 [2019-03-28 12:39:02,259 INFO L71 MaximizeFinalStates]: 0 new accepting states 28.94/14.51 [2019-03-28 12:39:02,289 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding 28.94/14.51 [2019-03-28 12:39:02,292 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states 28.94/14.51 [2019-03-28 12:39:02,294 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 28.94/14.51 [2019-03-28 12:39:02,294 INFO L71 MaximizeFinalStates]: 0 new accepting states 28.94/14.51 [2019-03-28 12:39:02,294 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 28.94/14.51 [2019-03-28 12:39:02,295 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 28.94/14.51 [2019-03-28 12:39:02,295 INFO L313 BlockEncoder]: Encoded RCFG 44 locations, 77 edges 28.94/14.51 [2019-03-28 12:39:02,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:39:02 BasicIcfg 28.94/14.51 [2019-03-28 12:39:02,296 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 28.94/14.51 [2019-03-28 12:39:02,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 28.94/14.51 [2019-03-28 12:39:02,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... 28.94/14.51 [2019-03-28 12:39:02,300 INFO L276 PluginConnector]: TraceAbstraction initialized 28.94/14.51 [2019-03-28 12:39:02,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:39:01" (1/4) ... 28.94/14.51 [2019-03-28 12:39:02,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c41bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:39:02, skipping insertion in model container 28.94/14.51 [2019-03-28 12:39:02,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:01" (2/4) ... 28.94/14.51 [2019-03-28 12:39:02,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c41bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:39:02, skipping insertion in model container 28.94/14.51 [2019-03-28 12:39:02,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:39:02" (3/4) ... 28.94/14.51 [2019-03-28 12:39:02,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c41bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:39:02, skipping insertion in model container 28.94/14.51 [2019-03-28 12:39:02,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:39:02" (4/4) ... 28.94/14.51 [2019-03-28 12:39:02,304 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 28.94/14.51 [2019-03-28 12:39:02,314 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 28.94/14.51 [2019-03-28 12:39:02,322 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 26 error locations. 28.94/14.51 [2019-03-28 12:39:02,339 INFO L257 AbstractCegarLoop]: Starting to check reachability of 26 error locations. 28.94/14.51 [2019-03-28 12:39:02,368 INFO L133 ementStrategyFactory]: Using default assertion order modulation 28.94/14.51 [2019-03-28 12:39:02,369 INFO L382 AbstractCegarLoop]: Interprodecural is true 28.94/14.51 [2019-03-28 12:39:02,369 INFO L383 AbstractCegarLoop]: Hoare is true 28.94/14.51 [2019-03-28 12:39:02,369 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 28.94/14.51 [2019-03-28 12:39:02,369 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 28.94/14.51 [2019-03-28 12:39:02,370 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 28.94/14.51 [2019-03-28 12:39:02,370 INFO L387 AbstractCegarLoop]: Difference is false 28.94/14.51 [2019-03-28 12:39:02,370 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 28.94/14.51 [2019-03-28 12:39:02,370 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 28.94/14.51 [2019-03-28 12:39:02,386 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. 28.94/14.51 [2019-03-28 12:39:02,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 28.94/14.51 [2019-03-28 12:39:02,391 INFO L394 BasicCegarLoop]: Found error trace 28.94/14.51 [2019-03-28 12:39:02,392 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 28.94/14.51 [2019-03-28 12:39:02,393 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 28.94/14.51 [2019-03-28 12:39:02,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.94/14.51 [2019-03-28 12:39:02,398 INFO L82 PathProgramCache]: Analyzing trace with hash 124290, now seen corresponding path program 1 times 28.94/14.51 [2019-03-28 12:39:02,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.94/14.51 [2019-03-28 12:39:02,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.94/14.51 [2019-03-28 12:39:02,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:02,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:02,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.94/14.51 [2019-03-28 12:39:02,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.94/14.51 [2019-03-28 12:39:02,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 28.94/14.51 [2019-03-28 12:39:02,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 28.94/14.51 [2019-03-28 12:39:02,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 28.94/14.51 [2019-03-28 12:39:02,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 28.94/14.51 [2019-03-28 12:39:02,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 28.94/14.51 [2019-03-28 12:39:02,609 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. 28.94/14.51 [2019-03-28 12:39:02,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 28.94/14.51 [2019-03-28 12:39:02,794 INFO L93 Difference]: Finished difference Result 44 states and 77 transitions. 28.94/14.51 [2019-03-28 12:39:02,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 28.94/14.51 [2019-03-28 12:39:02,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 28.94/14.51 [2019-03-28 12:39:02,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 28.94/14.51 [2019-03-28 12:39:02,810 INFO L225 Difference]: With dead ends: 44 28.94/14.51 [2019-03-28 12:39:02,810 INFO L226 Difference]: Without dead ends: 42 28.94/14.51 [2019-03-28 12:39:02,814 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 28.94/14.51 [2019-03-28 12:39:02,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. 28.94/14.51 [2019-03-28 12:39:02,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. 28.94/14.51 [2019-03-28 12:39:02,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 28.94/14.51 [2019-03-28 12:39:02,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. 28.94/14.51 [2019-03-28 12:39:02,855 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 3 28.94/14.51 [2019-03-28 12:39:02,857 INFO L84 Accepts]: Finished accepts. word is rejected. 28.94/14.51 [2019-03-28 12:39:02,857 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. 28.94/14.51 [2019-03-28 12:39:02,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 28.94/14.51 [2019-03-28 12:39:02,857 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. 28.94/14.51 [2019-03-28 12:39:02,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 28.94/14.51 [2019-03-28 12:39:02,858 INFO L394 BasicCegarLoop]: Found error trace 28.94/14.51 [2019-03-28 12:39:02,858 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 28.94/14.51 [2019-03-28 12:39:02,858 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 28.94/14.51 [2019-03-28 12:39:02,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.94/14.51 [2019-03-28 12:39:02,859 INFO L82 PathProgramCache]: Analyzing trace with hash 124292, now seen corresponding path program 1 times 28.94/14.51 [2019-03-28 12:39:02,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.94/14.51 [2019-03-28 12:39:02,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.94/14.51 [2019-03-28 12:39:02,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:02,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:02,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.94/14.51 [2019-03-28 12:39:02,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.94/14.51 [2019-03-28 12:39:02,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 28.94/14.51 [2019-03-28 12:39:02,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 28.94/14.51 [2019-03-28 12:39:02,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 28.94/14.51 [2019-03-28 12:39:02,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 28.94/14.51 [2019-03-28 12:39:02,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 28.94/14.51 [2019-03-28 12:39:02,889 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. 28.94/14.51 [2019-03-28 12:39:02,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 28.94/14.51 [2019-03-28 12:39:02,995 INFO L93 Difference]: Finished difference Result 44 states and 73 transitions. 28.94/14.51 [2019-03-28 12:39:02,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 28.94/14.51 [2019-03-28 12:39:02,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 28.94/14.51 [2019-03-28 12:39:02,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 28.94/14.51 [2019-03-28 12:39:02,997 INFO L225 Difference]: With dead ends: 44 28.94/14.51 [2019-03-28 12:39:02,997 INFO L226 Difference]: Without dead ends: 42 28.94/14.51 [2019-03-28 12:39:02,998 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 28.94/14.51 [2019-03-28 12:39:02,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. 28.94/14.51 [2019-03-28 12:39:03,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. 28.94/14.51 [2019-03-28 12:39:03,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 28.94/14.51 [2019-03-28 12:39:03,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 71 transitions. 28.94/14.51 [2019-03-28 12:39:03,004 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 71 transitions. Word has length 3 28.94/14.51 [2019-03-28 12:39:03,004 INFO L84 Accepts]: Finished accepts. word is rejected. 28.94/14.51 [2019-03-28 12:39:03,004 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 71 transitions. 28.94/14.51 [2019-03-28 12:39:03,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 28.94/14.51 [2019-03-28 12:39:03,005 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 71 transitions. 28.94/14.51 [2019-03-28 12:39:03,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 28.94/14.51 [2019-03-28 12:39:03,005 INFO L394 BasicCegarLoop]: Found error trace 28.94/14.51 [2019-03-28 12:39:03,005 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 28.94/14.51 [2019-03-28 12:39:03,006 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 28.94/14.51 [2019-03-28 12:39:03,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.94/14.51 [2019-03-28 12:39:03,006 INFO L82 PathProgramCache]: Analyzing trace with hash 124293, now seen corresponding path program 1 times 28.94/14.51 [2019-03-28 12:39:03,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.94/14.51 [2019-03-28 12:39:03,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.94/14.51 [2019-03-28 12:39:03,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:03,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:03,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.94/14.51 [2019-03-28 12:39:03,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.94/14.51 [2019-03-28 12:39:03,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 28.94/14.51 [2019-03-28 12:39:03,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 28.94/14.51 [2019-03-28 12:39:03,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 28.94/14.51 [2019-03-28 12:39:03,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 28.94/14.51 [2019-03-28 12:39:03,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 28.94/14.51 [2019-03-28 12:39:03,061 INFO L87 Difference]: Start difference. First operand 42 states and 71 transitions. Second operand 3 states. 28.94/14.51 [2019-03-28 12:39:03,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 28.94/14.51 [2019-03-28 12:39:03,190 INFO L93 Difference]: Finished difference Result 42 states and 71 transitions. 28.94/14.51 [2019-03-28 12:39:03,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 28.94/14.51 [2019-03-28 12:39:03,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 28.94/14.51 [2019-03-28 12:39:03,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 28.94/14.51 [2019-03-28 12:39:03,191 INFO L225 Difference]: With dead ends: 42 28.94/14.51 [2019-03-28 12:39:03,191 INFO L226 Difference]: Without dead ends: 40 28.94/14.51 [2019-03-28 12:39:03,192 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 28.94/14.51 [2019-03-28 12:39:03,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. 28.94/14.51 [2019-03-28 12:39:03,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. 28.94/14.51 [2019-03-28 12:39:03,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. 28.94/14.51 [2019-03-28 12:39:03,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 69 transitions. 28.94/14.51 [2019-03-28 12:39:03,197 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 69 transitions. Word has length 3 28.94/14.51 [2019-03-28 12:39:03,197 INFO L84 Accepts]: Finished accepts. word is rejected. 28.94/14.51 [2019-03-28 12:39:03,197 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 69 transitions. 28.94/14.51 [2019-03-28 12:39:03,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 28.94/14.51 [2019-03-28 12:39:03,198 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 69 transitions. 28.94/14.51 [2019-03-28 12:39:03,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 28.94/14.51 [2019-03-28 12:39:03,198 INFO L394 BasicCegarLoop]: Found error trace 28.94/14.51 [2019-03-28 12:39:03,198 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 28.94/14.51 [2019-03-28 12:39:03,199 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 28.94/14.51 [2019-03-28 12:39:03,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.94/14.51 [2019-03-28 12:39:03,199 INFO L82 PathProgramCache]: Analyzing trace with hash 3850587, now seen corresponding path program 1 times 28.94/14.51 [2019-03-28 12:39:03,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.94/14.51 [2019-03-28 12:39:03,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.94/14.51 [2019-03-28 12:39:03,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:03,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:03,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.94/14.51 [2019-03-28 12:39:03,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.94/14.51 [2019-03-28 12:39:03,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 28.94/14.51 [2019-03-28 12:39:03,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 28.94/14.51 [2019-03-28 12:39:03,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 28.94/14.51 [2019-03-28 12:39:03,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 28.94/14.51 [2019-03-28 12:39:03,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 28.94/14.51 [2019-03-28 12:39:03,237 INFO L87 Difference]: Start difference. First operand 40 states and 69 transitions. Second operand 3 states. 28.94/14.51 [2019-03-28 12:39:03,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 28.94/14.51 [2019-03-28 12:39:03,360 INFO L93 Difference]: Finished difference Result 40 states and 69 transitions. 28.94/14.51 [2019-03-28 12:39:03,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 28.94/14.51 [2019-03-28 12:39:03,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 28.94/14.51 [2019-03-28 12:39:03,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 28.94/14.51 [2019-03-28 12:39:03,361 INFO L225 Difference]: With dead ends: 40 28.94/14.51 [2019-03-28 12:39:03,361 INFO L226 Difference]: Without dead ends: 36 28.94/14.51 [2019-03-28 12:39:03,362 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 28.94/14.51 [2019-03-28 12:39:03,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. 28.94/14.51 [2019-03-28 12:39:03,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. 28.94/14.51 [2019-03-28 12:39:03,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. 28.94/14.51 [2019-03-28 12:39:03,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 61 transitions. 28.94/14.51 [2019-03-28 12:39:03,366 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 61 transitions. Word has length 4 28.94/14.51 [2019-03-28 12:39:03,367 INFO L84 Accepts]: Finished accepts. word is rejected. 28.94/14.51 [2019-03-28 12:39:03,367 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 61 transitions. 28.94/14.51 [2019-03-28 12:39:03,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 28.94/14.51 [2019-03-28 12:39:03,367 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 61 transitions. 28.94/14.51 [2019-03-28 12:39:03,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 28.94/14.51 [2019-03-28 12:39:03,367 INFO L394 BasicCegarLoop]: Found error trace 28.94/14.51 [2019-03-28 12:39:03,368 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 28.94/14.51 [2019-03-28 12:39:03,368 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 28.94/14.51 [2019-03-28 12:39:03,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.94/14.51 [2019-03-28 12:39:03,369 INFO L82 PathProgramCache]: Analyzing trace with hash 3850589, now seen corresponding path program 1 times 28.94/14.51 [2019-03-28 12:39:03,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.94/14.51 [2019-03-28 12:39:03,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.94/14.51 [2019-03-28 12:39:03,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:03,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:03,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.94/14.51 [2019-03-28 12:39:03,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.94/14.51 [2019-03-28 12:39:03,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 28.94/14.51 [2019-03-28 12:39:03,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 28.94/14.51 [2019-03-28 12:39:03,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 28.94/14.51 [2019-03-28 12:39:03,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 28.94/14.51 [2019-03-28 12:39:03,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 28.94/14.51 [2019-03-28 12:39:03,400 INFO L87 Difference]: Start difference. First operand 36 states and 61 transitions. Second operand 3 states. 28.94/14.51 [2019-03-28 12:39:03,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 28.94/14.51 [2019-03-28 12:39:03,480 INFO L93 Difference]: Finished difference Result 40 states and 61 transitions. 28.94/14.51 [2019-03-28 12:39:03,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 28.94/14.51 [2019-03-28 12:39:03,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 28.94/14.51 [2019-03-28 12:39:03,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 28.94/14.51 [2019-03-28 12:39:03,481 INFO L225 Difference]: With dead ends: 40 28.94/14.51 [2019-03-28 12:39:03,481 INFO L226 Difference]: Without dead ends: 36 28.94/14.51 [2019-03-28 12:39:03,482 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 28.94/14.51 [2019-03-28 12:39:03,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. 28.94/14.51 [2019-03-28 12:39:03,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. 28.94/14.51 [2019-03-28 12:39:03,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. 28.94/14.51 [2019-03-28 12:39:03,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 57 transitions. 28.94/14.51 [2019-03-28 12:39:03,486 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 57 transitions. Word has length 4 28.94/14.51 [2019-03-28 12:39:03,486 INFO L84 Accepts]: Finished accepts. word is rejected. 28.94/14.51 [2019-03-28 12:39:03,486 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 57 transitions. 28.94/14.51 [2019-03-28 12:39:03,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 28.94/14.51 [2019-03-28 12:39:03,487 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 57 transitions. 28.94/14.51 [2019-03-28 12:39:03,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 28.94/14.51 [2019-03-28 12:39:03,487 INFO L394 BasicCegarLoop]: Found error trace 28.94/14.51 [2019-03-28 12:39:03,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 28.94/14.51 [2019-03-28 12:39:03,488 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 28.94/14.51 [2019-03-28 12:39:03,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.94/14.51 [2019-03-28 12:39:03,488 INFO L82 PathProgramCache]: Analyzing trace with hash 3850590, now seen corresponding path program 1 times 28.94/14.51 [2019-03-28 12:39:03,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.94/14.51 [2019-03-28 12:39:03,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.94/14.51 [2019-03-28 12:39:03,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:03,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:03,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.94/14.51 [2019-03-28 12:39:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.94/14.51 [2019-03-28 12:39:03,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 28.94/14.51 [2019-03-28 12:39:03,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 28.94/14.51 [2019-03-28 12:39:03,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 28.94/14.51 [2019-03-28 12:39:03,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 28.94/14.51 [2019-03-28 12:39:03,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 28.94/14.51 [2019-03-28 12:39:03,523 INFO L87 Difference]: Start difference. First operand 36 states and 57 transitions. Second operand 3 states. 28.94/14.51 [2019-03-28 12:39:03,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 28.94/14.51 [2019-03-28 12:39:03,614 INFO L93 Difference]: Finished difference Result 36 states and 57 transitions. 28.94/14.51 [2019-03-28 12:39:03,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 28.94/14.51 [2019-03-28 12:39:03,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 28.94/14.51 [2019-03-28 12:39:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 28.94/14.51 [2019-03-28 12:39:03,616 INFO L225 Difference]: With dead ends: 36 28.94/14.51 [2019-03-28 12:39:03,616 INFO L226 Difference]: Without dead ends: 32 28.94/14.51 [2019-03-28 12:39:03,616 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 28.94/14.51 [2019-03-28 12:39:03,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. 28.94/14.51 [2019-03-28 12:39:03,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. 28.94/14.51 [2019-03-28 12:39:03,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 28.94/14.51 [2019-03-28 12:39:03,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 53 transitions. 28.94/14.51 [2019-03-28 12:39:03,621 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 53 transitions. Word has length 4 28.94/14.51 [2019-03-28 12:39:03,621 INFO L84 Accepts]: Finished accepts. word is rejected. 28.94/14.51 [2019-03-28 12:39:03,621 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 53 transitions. 28.94/14.51 [2019-03-28 12:39:03,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 28.94/14.51 [2019-03-28 12:39:03,621 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 53 transitions. 28.94/14.51 [2019-03-28 12:39:03,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 28.94/14.51 [2019-03-28 12:39:03,622 INFO L394 BasicCegarLoop]: Found error trace 28.94/14.51 [2019-03-28 12:39:03,622 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 28.94/14.51 [2019-03-28 12:39:03,622 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 28.94/14.51 [2019-03-28 12:39:03,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.94/14.51 [2019-03-28 12:39:03,622 INFO L82 PathProgramCache]: Analyzing trace with hash 119366637, now seen corresponding path program 1 times 28.94/14.51 [2019-03-28 12:39:03,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.94/14.51 [2019-03-28 12:39:03,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.94/14.51 [2019-03-28 12:39:03,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:03,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:03,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.94/14.51 [2019-03-28 12:39:03,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.94/14.51 [2019-03-28 12:39:03,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 28.94/14.51 [2019-03-28 12:39:03,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 28.94/14.51 [2019-03-28 12:39:03,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 28.94/14.51 [2019-03-28 12:39:03,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 28.94/14.51 [2019-03-28 12:39:03,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 28.94/14.51 [2019-03-28 12:39:03,656 INFO L87 Difference]: Start difference. First operand 32 states and 53 transitions. Second operand 3 states. 28.94/14.51 [2019-03-28 12:39:03,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 28.94/14.51 [2019-03-28 12:39:03,731 INFO L93 Difference]: Finished difference Result 32 states and 53 transitions. 28.94/14.51 [2019-03-28 12:39:03,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 28.94/14.51 [2019-03-28 12:39:03,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 28.94/14.51 [2019-03-28 12:39:03,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 28.94/14.51 [2019-03-28 12:39:03,733 INFO L225 Difference]: With dead ends: 32 28.94/14.51 [2019-03-28 12:39:03,733 INFO L226 Difference]: Without dead ends: 25 28.94/14.51 [2019-03-28 12:39:03,734 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 28.94/14.51 [2019-03-28 12:39:03,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. 28.94/14.51 [2019-03-28 12:39:03,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. 28.94/14.51 [2019-03-28 12:39:03,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 28.94/14.51 [2019-03-28 12:39:03,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. 28.94/14.51 [2019-03-28 12:39:03,737 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 39 transitions. Word has length 5 28.94/14.51 [2019-03-28 12:39:03,738 INFO L84 Accepts]: Finished accepts. word is rejected. 28.94/14.51 [2019-03-28 12:39:03,738 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 39 transitions. 28.94/14.51 [2019-03-28 12:39:03,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 28.94/14.51 [2019-03-28 12:39:03,738 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 39 transitions. 28.94/14.51 [2019-03-28 12:39:03,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 28.94/14.51 [2019-03-28 12:39:03,739 INFO L394 BasicCegarLoop]: Found error trace 28.94/14.51 [2019-03-28 12:39:03,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 28.94/14.51 [2019-03-28 12:39:03,739 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 28.94/14.51 [2019-03-28 12:39:03,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.94/14.51 [2019-03-28 12:39:03,739 INFO L82 PathProgramCache]: Analyzing trace with hash 119366635, now seen corresponding path program 1 times 28.94/14.51 [2019-03-28 12:39:03,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.94/14.51 [2019-03-28 12:39:03,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.94/14.51 [2019-03-28 12:39:03,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:03,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:03,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.94/14.51 [2019-03-28 12:39:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.94/14.51 [2019-03-28 12:39:03,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 28.94/14.51 [2019-03-28 12:39:03,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 28.94/14.51 [2019-03-28 12:39:03,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 28.94/14.51 [2019-03-28 12:39:03,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 28.94/14.51 [2019-03-28 12:39:03,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 28.94/14.51 [2019-03-28 12:39:03,766 INFO L87 Difference]: Start difference. First operand 25 states and 39 transitions. Second operand 3 states. 28.94/14.51 [2019-03-28 12:39:03,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 28.94/14.51 [2019-03-28 12:39:03,817 INFO L93 Difference]: Finished difference Result 25 states and 39 transitions. 28.94/14.51 [2019-03-28 12:39:03,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 28.94/14.51 [2019-03-28 12:39:03,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 28.94/14.51 [2019-03-28 12:39:03,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 28.94/14.51 [2019-03-28 12:39:03,818 INFO L225 Difference]: With dead ends: 25 28.94/14.51 [2019-03-28 12:39:03,818 INFO L226 Difference]: Without dead ends: 0 28.94/14.51 [2019-03-28 12:39:03,819 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 28.94/14.51 [2019-03-28 12:39:03,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 28.94/14.51 [2019-03-28 12:39:03,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 28.94/14.51 [2019-03-28 12:39:03,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 28.94/14.51 [2019-03-28 12:39:03,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 28.94/14.51 [2019-03-28 12:39:03,819 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 28.94/14.51 [2019-03-28 12:39:03,820 INFO L84 Accepts]: Finished accepts. word is rejected. 28.94/14.51 [2019-03-28 12:39:03,820 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 28.94/14.51 [2019-03-28 12:39:03,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 28.94/14.51 [2019-03-28 12:39:03,820 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 28.94/14.51 [2019-03-28 12:39:03,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 28.94/14.51 [2019-03-28 12:39:03,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 28.94/14.51 [2019-03-28 12:39:03,858 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,859 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,859 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,859 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,859 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,860 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,860 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,860 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,860 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,860 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,860 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,860 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,860 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,861 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,861 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,861 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,861 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,861 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,861 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,861 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,861 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,862 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,862 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,862 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,862 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,862 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,862 INFO L448 ceAbstractionStarter]: For program point L17-2(lines 17 23) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,862 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,862 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 16) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,863 INFO L444 ceAbstractionStarter]: At program point L17-4(lines 17 23) the Hoare annotation is: (and (= (select |#valid| ULTIMATE.start_test_fun_~z_ref~0.base) 1) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~z_ref~0.offset) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 4 (select |#length| ULTIMATE.start_test_fun_~z_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0)) 28.94/14.51 [2019-03-28 12:39:03,863 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,863 INFO L448 ceAbstractionStarter]: For program point L17-5(lines 17 23) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,863 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,863 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,864 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,864 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,864 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,864 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,864 INFO L448 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,864 INFO L448 ceAbstractionStarter]: For program point L22-2(line 22) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,864 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,864 INFO L448 ceAbstractionStarter]: For program point L18-1(lines 18 21) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,865 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,865 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. 28.94/14.51 [2019-03-28 12:39:03,866 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 28.94/14.51 [2019-03-28 12:39:03,874 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 28.94/14.51 [2019-03-28 12:39:03,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 28.94/14.51 [2019-03-28 12:39:03,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 28.94/14.51 [2019-03-28 12:39:03,882 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 28.94/14.51 [2019-03-28 12:39:03,882 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 28.94/14.51 [2019-03-28 12:39:03,883 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 28.94/14.51 [2019-03-28 12:39:03,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:39:03 BasicIcfg 28.94/14.51 [2019-03-28 12:39:03,885 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 28.94/14.51 [2019-03-28 12:39:03,886 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 28.94/14.51 [2019-03-28 12:39:03,886 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 28.94/14.51 [2019-03-28 12:39:03,890 INFO L276 PluginConnector]: BuchiAutomizer initialized 28.94/14.51 [2019-03-28 12:39:03,891 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 28.94/14.51 [2019-03-28 12:39:03,891 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:39:01" (1/5) ... 28.94/14.51 [2019-03-28 12:39:03,891 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7188677a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:39:03, skipping insertion in model container 28.94/14.51 [2019-03-28 12:39:03,891 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 28.94/14.51 [2019-03-28 12:39:03,892 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:01" (2/5) ... 28.94/14.51 [2019-03-28 12:39:03,892 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7188677a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:39:03, skipping insertion in model container 28.94/14.51 [2019-03-28 12:39:03,892 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 28.94/14.51 [2019-03-28 12:39:03,892 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:39:02" (3/5) ... 28.94/14.51 [2019-03-28 12:39:03,892 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7188677a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:39:03, skipping insertion in model container 28.94/14.51 [2019-03-28 12:39:03,893 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 28.94/14.51 [2019-03-28 12:39:03,893 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:39:02" (4/5) ... 28.94/14.51 [2019-03-28 12:39:03,894 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7188677a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:39:03, skipping insertion in model container 28.94/14.51 [2019-03-28 12:39:03,894 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 28.94/14.51 [2019-03-28 12:39:03,894 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:39:03" (5/5) ... 28.94/14.51 [2019-03-28 12:39:03,896 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 28.94/14.51 [2019-03-28 12:39:03,916 INFO L133 ementStrategyFactory]: Using default assertion order modulation 28.94/14.51 [2019-03-28 12:39:03,917 INFO L374 BuchiCegarLoop]: Interprodecural is true 28.94/14.51 [2019-03-28 12:39:03,917 INFO L375 BuchiCegarLoop]: Hoare is true 28.94/14.51 [2019-03-28 12:39:03,917 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 28.94/14.51 [2019-03-28 12:39:03,917 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 28.94/14.51 [2019-03-28 12:39:03,917 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 28.94/14.51 [2019-03-28 12:39:03,917 INFO L379 BuchiCegarLoop]: Difference is false 28.94/14.51 [2019-03-28 12:39:03,917 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 28.94/14.51 [2019-03-28 12:39:03,918 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 28.94/14.51 [2019-03-28 12:39:03,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. 28.94/14.51 [2019-03-28 12:39:03,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 28.94/14.51 [2019-03-28 12:39:03,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.94/14.51 [2019-03-28 12:39:03,928 INFO L119 BuchiIsEmpty]: Starting construction of run 28.94/14.51 [2019-03-28 12:39:03,932 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 28.94/14.51 [2019-03-28 12:39:03,932 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 28.94/14.51 [2019-03-28 12:39:03,932 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 28.94/14.51 [2019-03-28 12:39:03,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. 28.94/14.51 [2019-03-28 12:39:03,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 28.94/14.51 [2019-03-28 12:39:03,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.94/14.51 [2019-03-28 12:39:03,936 INFO L119 BuchiIsEmpty]: Starting construction of run 28.94/14.51 [2019-03-28 12:39:03,936 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 28.94/14.51 [2019-03-28 12:39:03,936 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 28.94/14.51 [2019-03-28 12:39:03,942 INFO L794 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRYtrue [93] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 13#L-1true [159] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~z_1 |v_ULTIMATE.start_test_fun_#in~z_1|) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet14_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_1, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~z=|v_ULTIMATE.start_test_fun_#in~z_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_main_#t~ret15=|v_ULTIMATE.start_main_#t~ret15_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~z, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~z, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_~z_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_main_#t~ret15, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 15#L10true [83] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 33#L10-1true [114] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 39#L11true [94] L11-->L12: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3) v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 v_ULTIMATE.start_test_fun_~z_3)) |v_#memory_int_5|) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 16#L12true [105] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem3_2|) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 44#L13true [137] L13-->L17-4: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem3_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 45#L17-4true 28.94/14.51 [2019-03-28 12:39:03,942 INFO L796 eck$LassoCheckResult]: Loop: 45#L17-4true [124] L17-4-->L17-1: Formula: (and (= 1 (select |v_#valid_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 28#L17-1true [110] L17-1-->L17-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_9) v_ULTIMATE.start_test_fun_~z_ref~0.offset_7)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_test_fun_~z_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_23|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 24#L17-2true [109] L17-2-->L18: Formula: (<= |v_ULTIMATE.start_test_fun_#t~mem6_6| |v_ULTIMATE.start_test_fun_#t~mem5_6|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 8#L18true [75] L18-->L18-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 5#L18-1true [149] L18-1-->L22: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem7_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 41#L22true [97] L22-->L22-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_11 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~z_ref~0.base_15)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~z_ref~0.base_15) v_ULTIMATE.start_test_fun_~z_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_11) (= (select |v_#valid_33| v_ULTIMATE.start_test_fun_~z_ref~0.base_15) 1)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_33|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 36#L22-1true [90] L22-1-->L22-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= 1 (select |v_#valid_35| v_ULTIMATE.start_test_fun_~y_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 12#L22-2true [223] L22-2-->L17-4: Formula: (and (= |v_#memory_int_21| (store |v_#memory_int_22| v_ULTIMATE.start_test_fun_~z_ref~0.base_27 (store (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~z_ref~0.base_27) v_ULTIMATE.start_test_fun_~z_ref~0.offset_20 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| |v_ULTIMATE.start_test_fun_#t~mem10_6|)))) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_20 4) (select |v_#length_34| v_ULTIMATE.start_test_fun_~z_ref~0.base_27)) (= 1 (select |v_#valid_51| v_ULTIMATE.start_test_fun_~z_ref~0.base_27)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_20)) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_27, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_22|, #length=|v_#length_34|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_20} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_27, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_21|, #length=|v_#length_34|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_20} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int, ULTIMATE.start_test_fun_#t~mem9] 45#L17-4true 28.94/14.51 [2019-03-28 12:39:03,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.94/14.51 [2019-03-28 12:39:03,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1281483396, now seen corresponding path program 1 times 28.94/14.51 [2019-03-28 12:39:03,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.94/14.51 [2019-03-28 12:39:03,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.94/14.51 [2019-03-28 12:39:03,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:03,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:03,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.94/14.51 [2019-03-28 12:39:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.94/14.51 [2019-03-28 12:39:03,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.94/14.51 [2019-03-28 12:39:03,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1588196002, now seen corresponding path program 1 times 28.94/14.51 [2019-03-28 12:39:03,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.94/14.51 [2019-03-28 12:39:03,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.94/14.51 [2019-03-28 12:39:03,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:03,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:03,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.94/14.51 [2019-03-28 12:39:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.94/14.51 [2019-03-28 12:39:04,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.94/14.51 [2019-03-28 12:39:04,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1849924323, now seen corresponding path program 1 times 28.94/14.51 [2019-03-28 12:39:04,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.94/14.51 [2019-03-28 12:39:04,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.94/14.51 [2019-03-28 12:39:04,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:04,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:04,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.94/14.51 [2019-03-28 12:39:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.94/14.51 [2019-03-28 12:39:04,555 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 28.94/14.51 [2019-03-28 12:39:04,718 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 90 28.94/14.51 [2019-03-28 12:39:04,732 INFO L216 LassoAnalysis]: Preferences: 28.94/14.51 [2019-03-28 12:39:04,734 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 28.94/14.51 [2019-03-28 12:39:04,734 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 28.94/14.51 [2019-03-28 12:39:04,734 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 28.94/14.51 [2019-03-28 12:39:04,734 INFO L127 ssoRankerPreferences]: Use exernal solver: false 28.94/14.51 [2019-03-28 12:39:04,734 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 28.94/14.51 [2019-03-28 12:39:04,734 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 28.94/14.51 [2019-03-28 12:39:04,735 INFO L130 ssoRankerPreferences]: Path of dumped script: 28.94/14.51 [2019-03-28 12:39:04,735 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 28.94/14.51 [2019-03-28 12:39:04,735 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 28.94/14.51 [2019-03-28 12:39:04,735 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 28.94/14.51 [2019-03-28 12:39:04,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:04,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:04,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:04,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:04,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:04,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:04,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:04,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:04,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:04,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:04,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:05,165 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 28.94/14.51 [2019-03-28 12:39:05,277 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 28.94/14.51 [2019-03-28 12:39:05,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:05,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:05,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:05,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:05,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:05,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:05,744 INFO L300 LassoAnalysis]: Preprocessing complete. 28.94/14.51 [2019-03-28 12:39:05,750 INFO L497 LassoAnalysis]: Using template 'affine'. 28.94/14.51 [2019-03-28 12:39:05,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.94/14.51 Termination analysis: LINEAR_WITH_GUESSES 28.94/14.51 Number of strict supporting invariants: 0 28.94/14.51 Number of non-strict supporting invariants: 1 28.94/14.51 Consider only non-deceasing supporting invariants: true 28.94/14.51 Simplify termination arguments: true 28.94/14.51 Simplify supporting invariants: trueOverapproximate stem: false 28.94/14.51 [2019-03-28 12:39:05,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.94/14.51 [2019-03-28 12:39:05,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.94/14.51 [2019-03-28 12:39:05,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.94/14.51 [2019-03-28 12:39:05,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.94/14.51 [2019-03-28 12:39:05,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.94/14.51 [2019-03-28 12:39:05,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.94/14.51 [2019-03-28 12:39:05,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.94/14.51 [2019-03-28 12:39:05,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.94/14.51 [2019-03-28 12:39:05,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.94/14.51 Termination analysis: LINEAR_WITH_GUESSES 28.94/14.51 Number of strict supporting invariants: 0 28.94/14.51 Number of non-strict supporting invariants: 1 28.94/14.51 Consider only non-deceasing supporting invariants: true 28.94/14.51 Simplify termination arguments: true 28.94/14.51 Simplify supporting invariants: trueOverapproximate stem: false 28.94/14.51 [2019-03-28 12:39:05,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.94/14.51 [2019-03-28 12:39:05,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.94/14.51 [2019-03-28 12:39:05,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.94/14.51 [2019-03-28 12:39:05,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.94/14.51 [2019-03-28 12:39:05,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.94/14.51 [2019-03-28 12:39:05,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.94/14.51 [2019-03-28 12:39:05,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.94/14.51 [2019-03-28 12:39:05,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.94/14.51 [2019-03-28 12:39:05,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.94/14.51 Termination analysis: LINEAR_WITH_GUESSES 28.94/14.51 Number of strict supporting invariants: 0 28.94/14.51 Number of non-strict supporting invariants: 1 28.94/14.51 Consider only non-deceasing supporting invariants: true 28.94/14.51 Simplify termination arguments: true 28.94/14.51 Simplify supporting invariants: trueOverapproximate stem: false 28.94/14.51 [2019-03-28 12:39:05,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.94/14.51 [2019-03-28 12:39:05,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.94/14.51 [2019-03-28 12:39:05,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.94/14.51 [2019-03-28 12:39:05,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.94/14.51 [2019-03-28 12:39:05,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.94/14.51 [2019-03-28 12:39:05,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.94/14.51 [2019-03-28 12:39:05,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.94/14.51 [2019-03-28 12:39:05,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.94/14.51 [2019-03-28 12:39:05,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.94/14.51 Termination analysis: LINEAR_WITH_GUESSES 28.94/14.51 Number of strict supporting invariants: 0 28.94/14.51 Number of non-strict supporting invariants: 1 28.94/14.51 Consider only non-deceasing supporting invariants: true 28.94/14.51 Simplify termination arguments: true 28.94/14.51 Simplify supporting invariants: trueOverapproximate stem: false 28.94/14.51 [2019-03-28 12:39:05,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.94/14.51 [2019-03-28 12:39:05,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.94/14.51 [2019-03-28 12:39:05,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.94/14.51 [2019-03-28 12:39:05,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.94/14.51 [2019-03-28 12:39:05,768 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 28.94/14.51 [2019-03-28 12:39:05,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 28.94/14.51 [2019-03-28 12:39:05,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.94/14.51 [2019-03-28 12:39:05,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.94/14.51 Termination analysis: LINEAR_WITH_GUESSES 28.94/14.51 Number of strict supporting invariants: 0 28.94/14.51 Number of non-strict supporting invariants: 1 28.94/14.51 Consider only non-deceasing supporting invariants: true 28.94/14.51 Simplify termination arguments: true 28.94/14.51 Simplify supporting invariants: trueOverapproximate stem: false 28.94/14.51 [2019-03-28 12:39:05,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.94/14.51 [2019-03-28 12:39:05,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.94/14.51 [2019-03-28 12:39:05,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.94/14.51 [2019-03-28 12:39:05,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.94/14.51 [2019-03-28 12:39:05,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.94/14.51 [2019-03-28 12:39:05,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.94/14.51 [2019-03-28 12:39:05,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.94/14.51 [2019-03-28 12:39:05,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.94/14.51 [2019-03-28 12:39:05,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.94/14.51 Termination analysis: LINEAR_WITH_GUESSES 28.94/14.51 Number of strict supporting invariants: 0 28.94/14.51 Number of non-strict supporting invariants: 1 28.94/14.51 Consider only non-deceasing supporting invariants: true 28.94/14.51 Simplify termination arguments: true 28.94/14.51 Simplify supporting invariants: trueOverapproximate stem: false 28.94/14.51 [2019-03-28 12:39:05,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.94/14.51 [2019-03-28 12:39:05,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.94/14.51 [2019-03-28 12:39:05,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.94/14.51 [2019-03-28 12:39:05,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.94/14.51 [2019-03-28 12:39:05,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.94/14.51 [2019-03-28 12:39:05,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.94/14.51 [2019-03-28 12:39:05,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.94/14.51 [2019-03-28 12:39:05,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.94/14.51 [2019-03-28 12:39:05,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.94/14.51 Termination analysis: LINEAR_WITH_GUESSES 28.94/14.51 Number of strict supporting invariants: 0 28.94/14.51 Number of non-strict supporting invariants: 1 28.94/14.51 Consider only non-deceasing supporting invariants: true 28.94/14.51 Simplify termination arguments: true 28.94/14.51 Simplify supporting invariants: trueOverapproximate stem: false 28.94/14.51 [2019-03-28 12:39:05,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.94/14.51 [2019-03-28 12:39:05,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.94/14.51 [2019-03-28 12:39:05,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.94/14.51 [2019-03-28 12:39:05,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.94/14.51 [2019-03-28 12:39:05,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.94/14.51 [2019-03-28 12:39:05,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.94/14.51 [2019-03-28 12:39:05,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.94/14.51 [2019-03-28 12:39:05,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.94/14.51 [2019-03-28 12:39:05,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.94/14.51 Termination analysis: LINEAR_WITH_GUESSES 28.94/14.51 Number of strict supporting invariants: 0 28.94/14.51 Number of non-strict supporting invariants: 1 28.94/14.51 Consider only non-deceasing supporting invariants: true 28.94/14.51 Simplify termination arguments: true 28.94/14.51 Simplify supporting invariants: trueOverapproximate stem: false 28.94/14.51 [2019-03-28 12:39:05,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.94/14.51 [2019-03-28 12:39:05,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.94/14.51 [2019-03-28 12:39:05,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.94/14.51 [2019-03-28 12:39:05,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.94/14.51 [2019-03-28 12:39:05,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 28.94/14.51 [2019-03-28 12:39:05,783 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 28.94/14.51 [2019-03-28 12:39:05,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.94/14.51 [2019-03-28 12:39:05,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.94/14.51 Termination analysis: LINEAR_WITH_GUESSES 28.94/14.51 Number of strict supporting invariants: 0 28.94/14.51 Number of non-strict supporting invariants: 1 28.94/14.51 Consider only non-deceasing supporting invariants: true 28.94/14.51 Simplify termination arguments: true 28.94/14.51 Simplify supporting invariants: trueOverapproximate stem: false 28.94/14.51 [2019-03-28 12:39:05,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.94/14.51 [2019-03-28 12:39:05,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.94/14.51 [2019-03-28 12:39:05,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.94/14.51 [2019-03-28 12:39:05,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.94/14.51 [2019-03-28 12:39:05,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.94/14.51 [2019-03-28 12:39:05,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.94/14.51 [2019-03-28 12:39:05,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.94/14.51 [2019-03-28 12:39:05,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.94/14.51 [2019-03-28 12:39:05,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.94/14.51 Termination analysis: LINEAR_WITH_GUESSES 28.94/14.51 Number of strict supporting invariants: 0 28.94/14.51 Number of non-strict supporting invariants: 1 28.94/14.51 Consider only non-deceasing supporting invariants: true 28.94/14.51 Simplify termination arguments: true 28.94/14.51 Simplify supporting invariants: trueOverapproximate stem: false 28.94/14.51 [2019-03-28 12:39:05,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.94/14.51 [2019-03-28 12:39:05,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.94/14.51 [2019-03-28 12:39:05,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.94/14.51 [2019-03-28 12:39:05,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.94/14.51 [2019-03-28 12:39:05,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 28.94/14.51 [2019-03-28 12:39:05,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 28.94/14.51 [2019-03-28 12:39:05,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.94/14.51 [2019-03-28 12:39:05,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.94/14.51 Termination analysis: LINEAR_WITH_GUESSES 28.94/14.51 Number of strict supporting invariants: 0 28.94/14.51 Number of non-strict supporting invariants: 1 28.94/14.51 Consider only non-deceasing supporting invariants: true 28.94/14.51 Simplify termination arguments: true 28.94/14.51 Simplify supporting invariants: trueOverapproximate stem: false 28.94/14.51 [2019-03-28 12:39:05,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.94/14.51 [2019-03-28 12:39:05,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.94/14.51 [2019-03-28 12:39:05,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.94/14.51 [2019-03-28 12:39:05,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.94/14.51 [2019-03-28 12:39:05,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 28.94/14.51 [2019-03-28 12:39:05,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 28.94/14.51 [2019-03-28 12:39:05,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.94/14.51 [2019-03-28 12:39:05,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.94/14.51 Termination analysis: LINEAR_WITH_GUESSES 28.94/14.51 Number of strict supporting invariants: 0 28.94/14.51 Number of non-strict supporting invariants: 1 28.94/14.51 Consider only non-deceasing supporting invariants: true 28.94/14.51 Simplify termination arguments: true 28.94/14.51 Simplify supporting invariants: trueOverapproximate stem: false 28.94/14.51 [2019-03-28 12:39:05,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.94/14.51 [2019-03-28 12:39:05,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.94/14.51 [2019-03-28 12:39:05,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.94/14.51 [2019-03-28 12:39:05,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.94/14.51 [2019-03-28 12:39:05,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 28.94/14.51 [2019-03-28 12:39:05,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 28.94/14.51 [2019-03-28 12:39:05,853 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 28.94/14.51 [2019-03-28 12:39:05,875 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 28.94/14.51 [2019-03-28 12:39:05,875 INFO L444 ModelExtractionUtils]: 34 out of 40 variables were initially zero. Simplification set additionally 2 variables to zero. 28.94/14.51 [2019-03-28 12:39:05,878 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 28.94/14.51 [2019-03-28 12:39:05,880 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 28.94/14.51 [2019-03-28 12:39:05,880 INFO L518 LassoAnalysis]: Proved termination. 28.94/14.51 [2019-03-28 12:39:05,881 INFO L520 LassoAnalysis]: Termination argument consisting of: 28.94/14.51 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 - 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 + 1 28.94/14.51 Supporting invariants [] 28.94/14.51 [2019-03-28 12:39:05,963 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed 28.94/14.51 [2019-03-28 12:39:05,969 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 28.94/14.51 [2019-03-28 12:39:05,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 28.94/14.51 [2019-03-28 12:39:05,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.94/14.51 [2019-03-28 12:39:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.94/14.51 [2019-03-28 12:39:06,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core 28.94/14.51 [2019-03-28 12:39:06,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.94/14.51 [2019-03-28 12:39:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.94/14.51 [2019-03-28 12:39:06,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 13 conjunts are in the unsatisfiable core 28.94/14.51 [2019-03-28 12:39:06,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.94/14.51 [2019-03-28 12:39:06,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.94/14.51 [2019-03-28 12:39:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.94/14.51 [2019-03-28 12:39:06,512 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 28.94/14.51 [2019-03-28 12:39:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.94/14.51 [2019-03-28 12:39:06,521 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 28.94/14.51 [2019-03-28 12:39:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.94/14.51 [2019-03-28 12:39:06,530 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 28.94/14.51 [2019-03-28 12:39:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.94/14.51 [2019-03-28 12:39:06,539 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 28.94/14.51 [2019-03-28 12:39:06,539 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 10 predicates after loop cannibalization 28.94/14.51 [2019-03-28 12:39:06,543 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 10 loop predicates 28.94/14.51 [2019-03-28 12:39:06,544 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 44 states. Second operand 10 states. 28.94/14.51 [2019-03-28 12:39:08,763 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 44 states.. Second operand 10 states. Result 405 states and 664 transitions. Complement of second has 106 states. 28.94/14.51 [2019-03-28 12:39:08,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 32 states 5 stem states 24 non-accepting loop states 3 accepting loop states 28.94/14.51 [2019-03-28 12:39:08,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 28.94/14.51 [2019-03-28 12:39:08,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 423 transitions. 28.94/14.51 [2019-03-28 12:39:08,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 423 transitions. Stem has 7 letters. Loop has 8 letters. 28.94/14.51 [2019-03-28 12:39:08,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.94/14.51 [2019-03-28 12:39:08,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 423 transitions. Stem has 15 letters. Loop has 8 letters. 28.94/14.51 [2019-03-28 12:39:08,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.94/14.51 [2019-03-28 12:39:08,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 423 transitions. Stem has 7 letters. Loop has 16 letters. 28.94/14.51 [2019-03-28 12:39:08,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.94/14.51 [2019-03-28 12:39:08,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 405 states and 664 transitions. 28.94/14.51 [2019-03-28 12:39:08,796 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 28.94/14.51 [2019-03-28 12:39:08,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 405 states to 56 states and 61 transitions. 28.94/14.51 [2019-03-28 12:39:08,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 28.94/14.51 [2019-03-28 12:39:08,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 28.94/14.51 [2019-03-28 12:39:08,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 61 transitions. 28.94/14.51 [2019-03-28 12:39:08,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 28.94/14.51 [2019-03-28 12:39:08,801 INFO L706 BuchiCegarLoop]: Abstraction has 56 states and 61 transitions. 28.94/14.51 [2019-03-28 12:39:08,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 61 transitions. 28.94/14.51 [2019-03-28 12:39:08,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 15. 28.94/14.51 [2019-03-28 12:39:08,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. 28.94/14.51 [2019-03-28 12:39:08,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. 28.94/14.51 [2019-03-28 12:39:08,803 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. 28.94/14.51 [2019-03-28 12:39:08,804 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. 28.94/14.51 [2019-03-28 12:39:08,804 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 28.94/14.51 [2019-03-28 12:39:08,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. 28.94/14.51 [2019-03-28 12:39:08,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 28.94/14.51 [2019-03-28 12:39:08,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.94/14.51 [2019-03-28 12:39:08,805 INFO L119 BuchiIsEmpty]: Starting construction of run 28.94/14.51 [2019-03-28 12:39:08,805 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 28.94/14.51 [2019-03-28 12:39:08,805 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 28.94/14.51 [2019-03-28 12:39:08,806 INFO L794 eck$LassoCheckResult]: Stem: 807#ULTIMATE.startENTRY [93] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 804#L-1 [158] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~z_1 |v_ULTIMATE.start_test_fun_#in~z_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet14_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_1, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~z=|v_ULTIMATE.start_test_fun_#in~z_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_main_#t~ret15=|v_ULTIMATE.start_main_#t~ret15_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~z, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~z, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_~z_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_main_#t~ret15, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 805#L10 [83] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 800#L10-1 [114] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 801#L11 [94] L11-->L12: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3) v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 v_ULTIMATE.start_test_fun_~z_3)) |v_#memory_int_5|) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 808#L12 [105] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem3_2|) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 809#L13 [137] L13-->L17-4: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem3_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 803#L17-4 28.94/14.51 [2019-03-28 12:39:08,806 INFO L796 eck$LassoCheckResult]: Loop: 803#L17-4 [124] L17-4-->L17-1: Formula: (and (= 1 (select |v_#valid_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 797#L17-1 [110] L17-1-->L17-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_9) v_ULTIMATE.start_test_fun_~z_ref~0.offset_7)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_test_fun_~z_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_23|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 795#L17-2 [109] L17-2-->L18: Formula: (<= |v_ULTIMATE.start_test_fun_#t~mem6_6| |v_ULTIMATE.start_test_fun_#t~mem5_6|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 796#L18 [75] L18-->L18-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 798#L18-1 [149] L18-1-->L22: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem7_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 799#L22 [97] L22-->L22-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_11 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~z_ref~0.base_15)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~z_ref~0.base_15) v_ULTIMATE.start_test_fun_~z_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_11) (= (select |v_#valid_33| v_ULTIMATE.start_test_fun_~z_ref~0.base_15) 1)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_33|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 806#L22-1 [90] L22-1-->L22-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= 1 (select |v_#valid_35| v_ULTIMATE.start_test_fun_~y_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 802#L22-2 [223] L22-2-->L17-4: Formula: (and (= |v_#memory_int_21| (store |v_#memory_int_22| v_ULTIMATE.start_test_fun_~z_ref~0.base_27 (store (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~z_ref~0.base_27) v_ULTIMATE.start_test_fun_~z_ref~0.offset_20 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| |v_ULTIMATE.start_test_fun_#t~mem10_6|)))) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_20 4) (select |v_#length_34| v_ULTIMATE.start_test_fun_~z_ref~0.base_27)) (= 1 (select |v_#valid_51| v_ULTIMATE.start_test_fun_~z_ref~0.base_27)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_20)) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_27, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_22|, #length=|v_#length_34|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_20} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_27, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_21|, #length=|v_#length_34|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_20} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int, ULTIMATE.start_test_fun_#t~mem9] 803#L17-4 28.94/14.51 [2019-03-28 12:39:08,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.94/14.51 [2019-03-28 12:39:08,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1310112547, now seen corresponding path program 1 times 28.94/14.51 [2019-03-28 12:39:08,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.94/14.51 [2019-03-28 12:39:08,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.94/14.51 [2019-03-28 12:39:08,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:08,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:08,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.94/14.51 [2019-03-28 12:39:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.94/14.51 [2019-03-28 12:39:08,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.94/14.51 [2019-03-28 12:39:08,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1588196002, now seen corresponding path program 2 times 28.94/14.51 [2019-03-28 12:39:08,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.94/14.51 [2019-03-28 12:39:08,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.94/14.51 [2019-03-28 12:39:08,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:08,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:08,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.94/14.51 [2019-03-28 12:39:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.94/14.51 [2019-03-28 12:39:08,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.94/14.51 [2019-03-28 12:39:08,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1344365698, now seen corresponding path program 1 times 28.94/14.51 [2019-03-28 12:39:08,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.94/14.51 [2019-03-28 12:39:08,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.94/14.51 [2019-03-28 12:39:08,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:08,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:08,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.94/14.51 [2019-03-28 12:39:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.94/14.51 [2019-03-28 12:39:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.94/14.51 [2019-03-28 12:39:09,309 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 99 28.94/14.51 [2019-03-28 12:39:09,467 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 91 28.94/14.51 [2019-03-28 12:39:09,470 INFO L216 LassoAnalysis]: Preferences: 28.94/14.51 [2019-03-28 12:39:09,470 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 28.94/14.51 [2019-03-28 12:39:09,471 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 28.94/14.51 [2019-03-28 12:39:09,471 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 28.94/14.51 [2019-03-28 12:39:09,471 INFO L127 ssoRankerPreferences]: Use exernal solver: false 28.94/14.51 [2019-03-28 12:39:09,471 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 28.94/14.51 [2019-03-28 12:39:09,471 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 28.94/14.51 [2019-03-28 12:39:09,471 INFO L130 ssoRankerPreferences]: Path of dumped script: 28.94/14.51 [2019-03-28 12:39:09,471 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 28.94/14.51 [2019-03-28 12:39:09,472 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 28.94/14.51 [2019-03-28 12:39:09,472 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 28.94/14.51 [2019-03-28 12:39:09,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:09,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:09,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:09,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:09,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:09,809 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 28.94/14.51 [2019-03-28 12:39:09,922 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 28.94/14.51 [2019-03-28 12:39:09,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:09,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:09,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:09,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:09,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:09,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:09,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:09,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:09,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:09,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:09,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:09,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.94/14.51 [2019-03-28 12:39:10,380 INFO L300 LassoAnalysis]: Preprocessing complete. 28.94/14.51 [2019-03-28 12:39:10,380 INFO L497 LassoAnalysis]: Using template 'affine'. 28.94/14.51 [2019-03-28 12:39:10,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.94/14.51 Termination analysis: LINEAR_WITH_GUESSES 28.94/14.51 Number of strict supporting invariants: 0 28.94/14.51 Number of non-strict supporting invariants: 1 28.94/14.51 Consider only non-deceasing supporting invariants: true 28.94/14.51 Simplify termination arguments: true 28.94/14.51 Simplify supporting invariants: trueOverapproximate stem: false 28.94/14.51 [2019-03-28 12:39:10,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.94/14.51 [2019-03-28 12:39:10,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.94/14.51 [2019-03-28 12:39:10,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.94/14.51 [2019-03-28 12:39:10,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.94/14.51 [2019-03-28 12:39:10,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.94/14.51 [2019-03-28 12:39:10,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.94/14.51 [2019-03-28 12:39:10,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.94/14.51 [2019-03-28 12:39:10,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.94/14.51 [2019-03-28 12:39:10,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.94/14.51 Termination analysis: LINEAR_WITH_GUESSES 28.94/14.51 Number of strict supporting invariants: 0 28.94/14.51 Number of non-strict supporting invariants: 1 28.94/14.51 Consider only non-deceasing supporting invariants: true 28.94/14.51 Simplify termination arguments: true 28.94/14.51 Simplify supporting invariants: trueOverapproximate stem: false 28.94/14.51 [2019-03-28 12:39:10,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.94/14.51 [2019-03-28 12:39:10,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.94/14.51 [2019-03-28 12:39:10,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.94/14.51 [2019-03-28 12:39:10,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.94/14.51 [2019-03-28 12:39:10,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.94/14.51 [2019-03-28 12:39:10,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.94/14.51 [2019-03-28 12:39:10,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.94/14.51 [2019-03-28 12:39:10,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.94/14.51 [2019-03-28 12:39:10,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.94/14.51 Termination analysis: LINEAR_WITH_GUESSES 28.94/14.51 Number of strict supporting invariants: 0 28.94/14.51 Number of non-strict supporting invariants: 1 28.94/14.51 Consider only non-deceasing supporting invariants: true 28.94/14.51 Simplify termination arguments: true 28.94/14.51 Simplify supporting invariants: trueOverapproximate stem: false 28.94/14.51 [2019-03-28 12:39:10,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.94/14.51 [2019-03-28 12:39:10,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.94/14.51 [2019-03-28 12:39:10,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.94/14.51 [2019-03-28 12:39:10,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.94/14.51 [2019-03-28 12:39:10,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.94/14.51 [2019-03-28 12:39:10,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.94/14.51 [2019-03-28 12:39:10,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.94/14.51 [2019-03-28 12:39:10,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.94/14.51 [2019-03-28 12:39:10,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.94/14.51 Termination analysis: LINEAR_WITH_GUESSES 28.94/14.51 Number of strict supporting invariants: 0 28.94/14.51 Number of non-strict supporting invariants: 1 28.94/14.51 Consider only non-deceasing supporting invariants: true 28.94/14.51 Simplify termination arguments: true 28.94/14.51 Simplify supporting invariants: trueOverapproximate stem: false 28.94/14.51 [2019-03-28 12:39:10,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.94/14.51 [2019-03-28 12:39:10,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.94/14.51 [2019-03-28 12:39:10,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.94/14.51 [2019-03-28 12:39:10,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.94/14.51 [2019-03-28 12:39:10,390 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 28.94/14.51 [2019-03-28 12:39:10,390 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 28.94/14.51 [2019-03-28 12:39:10,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.94/14.51 [2019-03-28 12:39:10,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.94/14.51 Termination analysis: LINEAR_WITH_GUESSES 28.94/14.51 Number of strict supporting invariants: 0 28.94/14.51 Number of non-strict supporting invariants: 1 28.94/14.51 Consider only non-deceasing supporting invariants: true 28.94/14.51 Simplify termination arguments: true 28.94/14.51 Simplify supporting invariants: trueOverapproximate stem: false 28.94/14.51 [2019-03-28 12:39:10,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.94/14.51 [2019-03-28 12:39:10,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.94/14.51 [2019-03-28 12:39:10,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.94/14.51 [2019-03-28 12:39:10,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.94/14.51 [2019-03-28 12:39:10,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 28.94/14.51 [2019-03-28 12:39:10,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 28.94/14.51 [2019-03-28 12:39:10,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.94/14.51 [2019-03-28 12:39:10,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.94/14.51 Termination analysis: LINEAR_WITH_GUESSES 28.94/14.51 Number of strict supporting invariants: 0 28.94/14.51 Number of non-strict supporting invariants: 1 28.94/14.51 Consider only non-deceasing supporting invariants: true 28.94/14.51 Simplify termination arguments: true 28.94/14.51 Simplify supporting invariants: trueOverapproximate stem: false 28.94/14.51 [2019-03-28 12:39:10,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.94/14.51 [2019-03-28 12:39:10,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.94/14.51 [2019-03-28 12:39:10,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.94/14.51 [2019-03-28 12:39:10,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.94/14.51 [2019-03-28 12:39:10,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 28.94/14.51 [2019-03-28 12:39:10,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 28.94/14.51 [2019-03-28 12:39:10,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.94/14.51 [2019-03-28 12:39:10,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.94/14.51 Termination analysis: LINEAR_WITH_GUESSES 28.94/14.51 Number of strict supporting invariants: 0 28.94/14.51 Number of non-strict supporting invariants: 1 28.94/14.51 Consider only non-deceasing supporting invariants: true 28.94/14.51 Simplify termination arguments: true 28.94/14.51 Simplify supporting invariants: trueOverapproximate stem: false 28.94/14.51 [2019-03-28 12:39:10,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.94/14.51 [2019-03-28 12:39:10,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.94/14.51 [2019-03-28 12:39:10,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.94/14.51 [2019-03-28 12:39:10,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.94/14.51 [2019-03-28 12:39:10,429 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 28.94/14.51 [2019-03-28 12:39:10,429 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 28.94/14.51 [2019-03-28 12:39:10,445 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 28.94/14.51 [2019-03-28 12:39:10,453 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 28.94/14.51 [2019-03-28 12:39:10,454 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 0 variables to zero. 28.94/14.51 [2019-03-28 12:39:10,454 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 28.94/14.51 [2019-03-28 12:39:10,455 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 28.94/14.51 [2019-03-28 12:39:10,455 INFO L518 LassoAnalysis]: Proved termination. 28.94/14.51 [2019-03-28 12:39:10,456 INFO L520 LassoAnalysis]: Termination argument consisting of: 28.94/14.51 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 - 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 + 1 28.94/14.51 Supporting invariants [] 28.94/14.51 [2019-03-28 12:39:10,545 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed 28.94/14.51 [2019-03-28 12:39:10,550 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 28.94/14.51 [2019-03-28 12:39:10,550 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 28.94/14.51 [2019-03-28 12:39:10,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.94/14.51 [2019-03-28 12:39:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.94/14.51 [2019-03-28 12:39:10,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core 28.94/14.51 [2019-03-28 12:39:10,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.94/14.51 [2019-03-28 12:39:10,634 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 14 treesize of output 12 28.94/14.51 [2019-03-28 12:39:10,634 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 28.94/14.51 [2019-03-28 12:39:10,641 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 28.94/14.51 [2019-03-28 12:39:10,641 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 28.94/14.51 [2019-03-28 12:39:10,642 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 28.94/14.51 [2019-03-28 12:39:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.94/14.51 [2019-03-28 12:39:10,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 13 conjunts are in the unsatisfiable core 28.94/14.51 [2019-03-28 12:39:10,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.94/14.51 [2019-03-28 12:39:10,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.94/14.51 [2019-03-28 12:39:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.94/14.51 [2019-03-28 12:39:11,002 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 28.94/14.51 [2019-03-28 12:39:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.94/14.51 [2019-03-28 12:39:11,011 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 28.94/14.51 [2019-03-28 12:39:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.94/14.51 [2019-03-28 12:39:11,019 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 28.94/14.51 [2019-03-28 12:39:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.94/14.51 [2019-03-28 12:39:11,028 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 28.94/14.51 [2019-03-28 12:39:11,028 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 10 predicates after loop cannibalization 28.94/14.51 [2019-03-28 12:39:11,028 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 10 loop predicates 28.94/14.51 [2019-03-28 12:39:11,028 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 15 states and 20 transitions. cyclomatic complexity: 6 Second operand 10 states. 28.94/14.51 [2019-03-28 12:39:11,427 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 15 states and 20 transitions. cyclomatic complexity: 6. Second operand 10 states. Result 31 states and 37 transitions. Complement of second has 24 states. 28.94/14.51 [2019-03-28 12:39:11,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 10 non-accepting loop states 2 accepting loop states 28.94/14.51 [2019-03-28 12:39:11,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 28.94/14.51 [2019-03-28 12:39:11,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 34 transitions. 28.94/14.51 [2019-03-28 12:39:11,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 34 transitions. Stem has 7 letters. Loop has 8 letters. 28.94/14.51 [2019-03-28 12:39:11,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.94/14.51 [2019-03-28 12:39:11,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 34 transitions. Stem has 15 letters. Loop has 8 letters. 28.94/14.51 [2019-03-28 12:39:11,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.94/14.51 [2019-03-28 12:39:11,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 34 transitions. Stem has 7 letters. Loop has 16 letters. 28.94/14.51 [2019-03-28 12:39:11,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.94/14.51 [2019-03-28 12:39:11,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. 28.94/14.51 [2019-03-28 12:39:11,437 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 28.94/14.51 [2019-03-28 12:39:11,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. 28.94/14.51 [2019-03-28 12:39:11,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 28.94/14.51 [2019-03-28 12:39:11,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 28.94/14.51 [2019-03-28 12:39:11,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 28.94/14.51 [2019-03-28 12:39:11,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 28.94/14.51 [2019-03-28 12:39:11,437 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 28.94/14.51 [2019-03-28 12:39:11,438 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 28.94/14.51 [2019-03-28 12:39:11,438 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 28.94/14.51 [2019-03-28 12:39:11,438 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 28.94/14.51 [2019-03-28 12:39:11,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 28.94/14.51 [2019-03-28 12:39:11,438 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 28.94/14.51 [2019-03-28 12:39:11,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 28.94/14.51 [2019-03-28 12:39:11,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:39:11 BasicIcfg 28.94/14.51 [2019-03-28 12:39:11,444 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 28.94/14.51 [2019-03-28 12:39:11,445 INFO L168 Benchmark]: Toolchain (without parser) took 10103.07 ms. Allocated memory was 649.6 MB in the beginning and 848.8 MB in the end (delta: 199.2 MB). Free memory was 558.5 MB in the beginning and 581.9 MB in the end (delta: -23.5 MB). Peak memory consumption was 175.8 MB. Max. memory is 50.3 GB. 28.94/14.51 [2019-03-28 12:39:11,446 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 28.94/14.51 [2019-03-28 12:39:11,446 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.13 ms. Allocated memory was 649.6 MB in the beginning and 675.8 MB in the end (delta: 26.2 MB). Free memory was 558.5 MB in the beginning and 642.1 MB in the end (delta: -83.6 MB). Peak memory consumption was 31.7 MB. Max. memory is 50.3 GB. 28.94/14.51 [2019-03-28 12:39:11,447 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.14 ms. Allocated memory is still 675.8 MB. Free memory was 642.1 MB in the beginning and 638.2 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 28.94/14.51 [2019-03-28 12:39:11,447 INFO L168 Benchmark]: Boogie Preprocessor took 26.49 ms. Allocated memory is still 675.8 MB. Free memory was 638.2 MB in the beginning and 637.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 28.94/14.51 [2019-03-28 12:39:11,448 INFO L168 Benchmark]: RCFGBuilder took 425.85 ms. Allocated memory is still 675.8 MB. Free memory was 636.0 MB in the beginning and 610.4 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 50.3 GB. 28.94/14.51 [2019-03-28 12:39:11,449 INFO L168 Benchmark]: BlockEncodingV2 took 137.31 ms. Allocated memory is still 675.8 MB. Free memory was 610.4 MB in the beginning and 599.6 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 28.94/14.51 [2019-03-28 12:39:11,449 INFO L168 Benchmark]: TraceAbstraction took 1588.16 ms. Allocated memory is still 675.8 MB. Free memory was 599.6 MB in the beginning and 415.1 MB in the end (delta: 184.5 MB). Peak memory consumption was 184.5 MB. Max. memory is 50.3 GB. 28.94/14.51 [2019-03-28 12:39:11,450 INFO L168 Benchmark]: BuchiAutomizer took 7558.72 ms. Allocated memory was 675.8 MB in the beginning and 848.8 MB in the end (delta: 173.0 MB). Free memory was 415.1 MB in the beginning and 581.9 MB in the end (delta: -166.9 MB). Peak memory consumption was 6.1 MB. Max. memory is 50.3 GB. 28.94/14.51 [2019-03-28 12:39:11,454 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 28.94/14.51 --- Results --- 28.94/14.51 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 28.94/14.51 - StatisticsResult: Initial Icfg 28.94/14.51 52 locations, 55 edges 28.94/14.51 - StatisticsResult: Encoded RCFG 28.94/14.51 44 locations, 77 edges 28.94/14.51 * Results from de.uni_freiburg.informatik.ultimate.core: 28.94/14.51 - StatisticsResult: Toolchain Benchmarks 28.94/14.51 Benchmark results are: 28.94/14.51 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 28.94/14.51 * CACSL2BoogieTranslator took 315.13 ms. Allocated memory was 649.6 MB in the beginning and 675.8 MB in the end (delta: 26.2 MB). Free memory was 558.5 MB in the beginning and 642.1 MB in the end (delta: -83.6 MB). Peak memory consumption was 31.7 MB. Max. memory is 50.3 GB. 28.94/14.51 * Boogie Procedure Inliner took 46.14 ms. Allocated memory is still 675.8 MB. Free memory was 642.1 MB in the beginning and 638.2 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 28.94/14.51 * Boogie Preprocessor took 26.49 ms. Allocated memory is still 675.8 MB. Free memory was 638.2 MB in the beginning and 637.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 28.94/14.51 * RCFGBuilder took 425.85 ms. Allocated memory is still 675.8 MB. Free memory was 636.0 MB in the beginning and 610.4 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 50.3 GB. 28.94/14.51 * BlockEncodingV2 took 137.31 ms. Allocated memory is still 675.8 MB. Free memory was 610.4 MB in the beginning and 599.6 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 28.94/14.51 * TraceAbstraction took 1588.16 ms. Allocated memory is still 675.8 MB. Free memory was 599.6 MB in the beginning and 415.1 MB in the end (delta: 184.5 MB). Peak memory consumption was 184.5 MB. Max. memory is 50.3 GB. 28.94/14.51 * BuchiAutomizer took 7558.72 ms. Allocated memory was 675.8 MB in the beginning and 848.8 MB in the end (delta: 173.0 MB). Free memory was 415.1 MB in the beginning and 581.9 MB in the end (delta: -166.9 MB). Peak memory consumption was 6.1 MB. Max. memory is 50.3 GB. 28.94/14.51 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 28.94/14.51 - GenericResult: Unfinished Backtranslation 28.94/14.51 unknown boogie variable #length 28.94/14.51 - GenericResult: Unfinished Backtranslation 28.94/14.51 unknown boogie variable #length 28.94/14.51 - GenericResult: Unfinished Backtranslation 28.94/14.51 unknown boogie variable #length 28.94/14.51 - GenericResult: Unfinished Backtranslation 28.94/14.51 unknown boogie variable #length 28.94/14.51 - GenericResult: Unfinished Backtranslation 28.94/14.51 unknown boogie variable #length 28.94/14.51 - GenericResult: Unfinished Backtranslation 28.94/14.51 unknown boogie variable #length 28.94/14.51 - GenericResult: Unfinished Backtranslation 28.94/14.51 unknown boogie variable #memory_int 28.94/14.51 - GenericResult: Unfinished Backtranslation 28.94/14.51 unknown boogie variable #memory_int 28.94/14.51 - GenericResult: Unfinished Backtranslation 28.94/14.51 unknown boogie variable #memory_int 28.94/14.51 - GenericResult: Unfinished Backtranslation 28.94/14.51 unknown boogie variable #memory_int 28.94/14.51 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 28.94/14.51 - PositiveResult [Line: 18]: pointer dereference always succeeds 28.94/14.51 For all program executions holds that pointer dereference always succeeds at this location 28.94/14.51 - PositiveResult [Line: 17]: pointer dereference always succeeds 28.94/14.51 For all program executions holds that pointer dereference always succeeds at this location 28.94/14.51 - PositiveResult [Line: 17]: pointer dereference always succeeds 28.94/14.51 For all program executions holds that pointer dereference always succeeds at this location 28.94/14.51 - PositiveResult [Line: 20]: pointer dereference always succeeds 28.94/14.51 For all program executions holds that pointer dereference always succeeds at this location 28.94/14.51 - PositiveResult [Line: 20]: pointer dereference always succeeds 28.94/14.51 For all program executions holds that pointer dereference always succeeds at this location 28.94/14.51 - PositiveResult [Line: 18]: pointer dereference always succeeds 28.94/14.51 For all program executions holds that pointer dereference always succeeds at this location 28.94/14.51 - PositiveResult [Line: 22]: pointer dereference always succeeds 28.94/14.51 For all program executions holds that pointer dereference always succeeds at this location 28.94/14.51 - PositiveResult [Line: 22]: pointer dereference always succeeds 28.94/14.51 For all program executions holds that pointer dereference always succeeds at this location 28.94/14.51 - PositiveResult [Line: 10]: pointer dereference always succeeds 28.94/14.51 For all program executions holds that pointer dereference always succeeds at this location 28.94/14.51 - PositiveResult [Line: 10]: pointer dereference always succeeds 28.94/14.51 For all program executions holds that pointer dereference always succeeds at this location 28.94/14.51 - PositiveResult [Line: 22]: pointer dereference always succeeds 28.94/14.51 For all program executions holds that pointer dereference always succeeds at this location 28.94/14.51 - PositiveResult [Line: 22]: pointer dereference always succeeds 28.94/14.51 For all program executions holds that pointer dereference always succeeds at this location 28.94/14.51 - PositiveResult [Line: 22]: pointer dereference always succeeds 28.94/14.51 For all program executions holds that pointer dereference always succeeds at this location 28.94/14.51 - PositiveResult [Line: 11]: pointer dereference always succeeds 28.94/14.51 For all program executions holds that pointer dereference always succeeds at this location 28.94/14.51 - PositiveResult [Line: 24]: pointer dereference always succeeds 28.94/14.51 For all program executions holds that pointer dereference always succeeds at this location 28.94/14.51 - PositiveResult [Line: 24]: pointer dereference always succeeds 28.94/14.51 For all program executions holds that pointer dereference always succeeds at this location 28.94/14.51 - PositiveResult [Line: 22]: pointer dereference always succeeds 28.94/14.51 For all program executions holds that pointer dereference always succeeds at this location 28.94/14.51 - PositiveResult [Line: 11]: pointer dereference always succeeds 28.94/14.51 For all program executions holds that pointer dereference always succeeds at this location 28.94/14.51 - PositiveResult [Line: 13]: pointer dereference always succeeds 28.94/14.51 For all program executions holds that pointer dereference always succeeds at this location 28.94/14.51 - PositiveResult [Line: 12]: pointer dereference always succeeds 28.94/14.51 For all program executions holds that pointer dereference always succeeds at this location 28.94/14.51 - PositiveResult [Line: 12]: pointer dereference always succeeds 28.94/14.51 For all program executions holds that pointer dereference always succeeds at this location 28.94/14.51 - PositiveResult [Line: 15]: pointer dereference always succeeds 28.94/14.51 For all program executions holds that pointer dereference always succeeds at this location 28.94/14.51 - PositiveResult [Line: 15]: pointer dereference always succeeds 28.94/14.51 For all program executions holds that pointer dereference always succeeds at this location 28.94/14.51 - PositiveResult [Line: 13]: pointer dereference always succeeds 28.94/14.51 For all program executions holds that pointer dereference always succeeds at this location 28.94/14.51 - PositiveResult [Line: 17]: pointer dereference always succeeds 28.94/14.51 For all program executions holds that pointer dereference always succeeds at this location 28.94/14.51 - PositiveResult [Line: 17]: pointer dereference always succeeds 28.94/14.51 For all program executions holds that pointer dereference always succeeds at this location 28.94/14.51 - AllSpecificationsHoldResult: All specifications hold 28.94/14.51 26 specifications checked. All of them hold 28.94/14.51 - InvariantResult [Line: 17]: Loop Invariant 28.94/14.51 [2019-03-28 12:39:11,463 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 28.94/14.51 [2019-03-28 12:39:11,464 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 28.94/14.51 [2019-03-28 12:39:11,464 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 28.94/14.51 [2019-03-28 12:39:11,465 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 28.94/14.51 [2019-03-28 12:39:11,465 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 28.94/14.51 [2019-03-28 12:39:11,465 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 28.94/14.51 Derived loop invariant: (((((((\valid[z_ref] == 1 && 4 == unknown-#length-unknown[x_ref]) && 0 == z_ref) && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 4 == unknown-#length-unknown[z_ref]) && 1 == \valid[x_ref]) && y_ref == 0 28.94/14.51 - StatisticsResult: Ultimate Automizer benchmark data 28.94/14.51 CFG has 1 procedures, 44 locations, 26 error locations. SAFE Result, 1.5s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 46 SDtfs, 369 SDslu, 5 SDs, 0 SdLazy, 405 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, 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.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 327 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 28.94/14.51 - StatisticsResult: Constructed decomposition of program 28.94/14.51 Your program was decomposed into 2 terminating modules (0 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[x_ref][x_ref] + -2 * unknown-#memory_int-unknown[z_ref][z_ref] + 1 and consists of 32 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[x_ref][x_ref] + -2 * unknown-#memory_int-unknown[z_ref][z_ref] + 1 and consists of 14 locations. 28.94/14.51 - StatisticsResult: Timing statistics 28.94/14.51 BüchiAutomizer plugin needed 7.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.7s. Construction of modules took 1.0s. Büchi inclusion checks took 2.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 41 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 21 SDtfs, 746 SDslu, 177 SDs, 0 SdLazy, 1532 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital293 mio100 ax100 hnf100 lsp95 ukn67 mio100 lsp36 div100 bol100 ite100 ukn100 eq179 hnf88 smp94 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 28.94/14.51 - TerminationAnalysisResult: Termination proven 28.94/14.51 Buchi Automizer proved that your program is terminating 28.94/14.51 RESULT: Ultimate proved your program to be correct! 28.94/14.51 !SESSION 2019-03-28 12:38:58.092 ----------------------------------------------- 28.94/14.51 eclipse.buildId=unknown 28.94/14.51 java.version=1.8.0_181 28.94/14.51 java.vendor=Oracle Corporation 28.94/14.51 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 28.94/14.51 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 28.94/14.51 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 28.94/14.51 28.94/14.51 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:39:11.691 28.94/14.51 !MESSAGE The workspace will exit with unsaved changes in this session. 28.94/14.51 Received shutdown request... 28.94/14.51 Ultimate: 28.94/14.51 GTK+ Version Check 28.94/14.51 EOF