67.87/34.38 YES 67.87/34.38 67.87/34.38 Ultimate: Cannot open display: 67.87/34.38 This is Ultimate 0.1.24-8dc7c08-m 67.87/34.38 [2019-03-28 12:37:17,466 INFO L170 SettingsManager]: Resetting all preferences to default values... 67.87/34.38 [2019-03-28 12:37:17,468 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 67.87/34.38 [2019-03-28 12:37:17,481 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 67.87/34.38 [2019-03-28 12:37:17,482 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 67.87/34.38 [2019-03-28 12:37:17,483 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 67.87/34.38 [2019-03-28 12:37:17,484 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 67.87/34.38 [2019-03-28 12:37:17,485 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 67.87/34.38 [2019-03-28 12:37:17,487 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 67.87/34.38 [2019-03-28 12:37:17,488 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 67.87/34.38 [2019-03-28 12:37:17,488 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 67.87/34.38 [2019-03-28 12:37:17,489 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 67.87/34.38 [2019-03-28 12:37:17,490 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 67.87/34.38 [2019-03-28 12:37:17,490 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 67.87/34.38 [2019-03-28 12:37:17,492 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 67.87/34.38 [2019-03-28 12:37:17,492 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 67.87/34.38 [2019-03-28 12:37:17,493 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 67.87/34.38 [2019-03-28 12:37:17,495 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 67.87/34.38 [2019-03-28 12:37:17,496 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 67.87/34.38 [2019-03-28 12:37:17,498 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 67.87/34.38 [2019-03-28 12:37:17,499 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 67.87/34.38 [2019-03-28 12:37:17,500 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 67.87/34.38 [2019-03-28 12:37:17,502 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 67.87/34.38 [2019-03-28 12:37:17,502 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 67.87/34.38 [2019-03-28 12:37:17,502 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 67.87/34.38 [2019-03-28 12:37:17,503 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 67.87/34.38 [2019-03-28 12:37:17,504 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 67.87/34.38 [2019-03-28 12:37:17,505 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 67.87/34.38 [2019-03-28 12:37:17,505 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 67.87/34.38 [2019-03-28 12:37:17,505 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 67.87/34.38 [2019-03-28 12:37:17,506 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 67.87/34.38 [2019-03-28 12:37:17,507 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 67.87/34.38 [2019-03-28 12:37:17,508 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 67.87/34.38 [2019-03-28 12:37:17,508 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 67.87/34.38 [2019-03-28 12:37:17,509 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 67.87/34.38 [2019-03-28 12:37:17,509 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 67.87/34.38 [2019-03-28 12:37:17,509 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 67.87/34.38 [2019-03-28 12:37:17,510 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 67.87/34.38 [2019-03-28 12:37:17,511 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 67.87/34.38 [2019-03-28 12:37:17,511 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 67.87/34.38 [2019-03-28 12:37:17,526 INFO L110 SettingsManager]: Loading preferences was successful 67.87/34.38 [2019-03-28 12:37:17,526 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 67.87/34.38 [2019-03-28 12:37:17,527 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 67.87/34.38 [2019-03-28 12:37:17,527 INFO L133 SettingsManager]: * Rewrite not-equals=true 67.87/34.38 [2019-03-28 12:37:17,527 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 67.87/34.38 [2019-03-28 12:37:17,528 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 67.87/34.38 [2019-03-28 12:37:17,528 INFO L133 SettingsManager]: * Use SBE=true 67.87/34.38 [2019-03-28 12:37:17,528 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 67.87/34.38 [2019-03-28 12:37:17,528 INFO L133 SettingsManager]: * Use old map elimination=false 67.87/34.38 [2019-03-28 12:37:17,528 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 67.87/34.38 [2019-03-28 12:37:17,529 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 67.87/34.38 [2019-03-28 12:37:17,529 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 67.87/34.38 [2019-03-28 12:37:17,529 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 67.87/34.38 [2019-03-28 12:37:17,529 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 67.87/34.38 [2019-03-28 12:37:17,529 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 67.87/34.38 [2019-03-28 12:37:17,529 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 67.87/34.38 [2019-03-28 12:37:17,530 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 67.87/34.38 [2019-03-28 12:37:17,530 INFO L133 SettingsManager]: * Check division by zero=IGNORE 67.87/34.38 [2019-03-28 12:37:17,530 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 67.87/34.38 [2019-03-28 12:37:17,530 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 67.87/34.38 [2019-03-28 12:37:17,530 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 67.87/34.38 [2019-03-28 12:37:17,530 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 67.87/34.38 [2019-03-28 12:37:17,531 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 67.87/34.38 [2019-03-28 12:37:17,531 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 67.87/34.38 [2019-03-28 12:37:17,531 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 67.87/34.38 [2019-03-28 12:37:17,531 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 67.87/34.38 [2019-03-28 12:37:17,531 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 67.87/34.38 [2019-03-28 12:37:17,531 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 67.87/34.38 [2019-03-28 12:37:17,532 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 67.87/34.38 [2019-03-28 12:37:17,557 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 67.87/34.38 [2019-03-28 12:37:17,578 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 67.87/34.38 [2019-03-28 12:37:17,582 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 67.87/34.38 [2019-03-28 12:37:17,583 INFO L271 PluginConnector]: Initializing CDTParser... 67.87/34.38 [2019-03-28 12:37:17,583 INFO L276 PluginConnector]: CDTParser initialized 67.87/34.38 [2019-03-28 12:37:17,584 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 67.87/34.38 [2019-03-28 12:37:17,656 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/af1f7e6b01734a829b9a2b2a01c48d55/FLAG86422708b 67.87/34.38 [2019-03-28 12:37:19,695 INFO L307 CDTParser]: Found 1 translation units. 67.87/34.38 [2019-03-28 12:37:19,696 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 67.87/34.38 [2019-03-28 12:37:19,696 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 67.87/34.38 [2019-03-28 12:37:19,703 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/af1f7e6b01734a829b9a2b2a01c48d55/FLAG86422708b 67.87/34.38 [2019-03-28 12:37:20,120 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/af1f7e6b01734a829b9a2b2a01c48d55 67.87/34.38 [2019-03-28 12:37:20,132 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 67.87/34.38 [2019-03-28 12:37:20,133 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 67.87/34.38 [2019-03-28 12:37:20,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 67.87/34.38 [2019-03-28 12:37:20,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 67.87/34.38 [2019-03-28 12:37:20,138 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 67.87/34.38 [2019-03-28 12:37:20,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:37:20" (1/1) ... 67.87/34.38 [2019-03-28 12:37:20,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@489017bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:20, skipping insertion in model container 67.87/34.38 [2019-03-28 12:37:20,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:37:20" (1/1) ... 67.87/34.38 [2019-03-28 12:37:20,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 67.87/34.38 [2019-03-28 12:37:20,169 INFO L176 MainTranslator]: Built tables and reachable declarations 67.87/34.38 [2019-03-28 12:37:20,335 INFO L206 PostProcessor]: Analyzing one entry point: main 67.87/34.38 [2019-03-28 12:37:20,348 INFO L191 MainTranslator]: Completed pre-run 67.87/34.38 [2019-03-28 12:37:20,367 INFO L206 PostProcessor]: Analyzing one entry point: main 67.87/34.38 [2019-03-28 12:37:20,443 INFO L195 MainTranslator]: Completed translation 67.87/34.38 [2019-03-28 12:37:20,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:20 WrapperNode 67.87/34.38 [2019-03-28 12:37:20,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 67.87/34.38 [2019-03-28 12:37:20,445 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 67.87/34.38 [2019-03-28 12:37:20,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 67.87/34.38 [2019-03-28 12:37:20,446 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 67.87/34.38 [2019-03-28 12:37:20,457 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:37:20" (1/1) ... 67.87/34.38 [2019-03-28 12:37:20,466 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:37:20" (1/1) ... 67.87/34.38 [2019-03-28 12:37:20,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 67.87/34.38 [2019-03-28 12:37:20,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 67.87/34.38 [2019-03-28 12:37:20,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 67.87/34.38 [2019-03-28 12:37:20,488 INFO L276 PluginConnector]: Boogie Preprocessor initialized 67.87/34.38 [2019-03-28 12:37:20,498 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:20" (1/1) ... 67.87/34.38 [2019-03-28 12:37:20,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:20" (1/1) ... 67.87/34.38 [2019-03-28 12:37:20,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:20" (1/1) ... 67.87/34.38 [2019-03-28 12:37:20,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:20" (1/1) ... 67.87/34.38 [2019-03-28 12:37:20,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:20" (1/1) ... 67.87/34.38 [2019-03-28 12:37:20,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:20" (1/1) ... 67.87/34.38 [2019-03-28 12:37:20,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:20" (1/1) ... 67.87/34.38 [2019-03-28 12:37:20,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 67.87/34.38 [2019-03-28 12:37:20,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 67.87/34.38 [2019-03-28 12:37:20,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... 67.87/34.38 [2019-03-28 12:37:20,514 INFO L276 PluginConnector]: RCFGBuilder initialized 67.87/34.38 [2019-03-28 12:37:20,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:20" (1/1) ... 67.87/34.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 67.87/34.38 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 67.87/34.38 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 67.87/34.38 [2019-03-28 12:37:20,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 67.87/34.38 [2019-03-28 12:37:20,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 67.87/34.38 [2019-03-28 12:37:20,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 67.87/34.38 [2019-03-28 12:37:20,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 67.87/34.38 [2019-03-28 12:37:20,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 67.87/34.38 [2019-03-28 12:37:20,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 67.87/34.38 [2019-03-28 12:37:20,878 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 67.87/34.38 [2019-03-28 12:37:20,879 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 67.87/34.38 [2019-03-28 12:37:20,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:37:20 BoogieIcfgContainer 67.87/34.38 [2019-03-28 12:37:20,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 67.87/34.38 [2019-03-28 12:37:20,881 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 67.87/34.38 [2019-03-28 12:37:20,881 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 67.87/34.38 [2019-03-28 12:37:20,883 INFO L276 PluginConnector]: BlockEncodingV2 initialized 67.87/34.38 [2019-03-28 12:37:20,884 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:37:20" (1/1) ... 67.87/34.38 [2019-03-28 12:37:20,904 INFO L313 BlockEncoder]: Initial Icfg 58 locations, 63 edges 67.87/34.38 [2019-03-28 12:37:20,905 INFO L258 BlockEncoder]: Using Remove infeasible edges 67.87/34.38 [2019-03-28 12:37:20,906 INFO L263 BlockEncoder]: Using Maximize final states 67.87/34.38 [2019-03-28 12:37:20,907 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 67.87/34.38 [2019-03-28 12:37:20,907 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 67.87/34.38 [2019-03-28 12:37:20,911 INFO L296 BlockEncoder]: Using Remove sink states 67.87/34.38 [2019-03-28 12:37:20,912 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 67.87/34.38 [2019-03-28 12:37:20,912 INFO L179 BlockEncoder]: Using Rewrite not-equals 67.87/34.38 [2019-03-28 12:37:20,940 INFO L185 BlockEncoder]: Using Use SBE 67.87/34.38 [2019-03-28 12:37:20,975 INFO L200 BlockEncoder]: SBE split 31 edges 67.87/34.38 [2019-03-28 12:37:20,980 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 67.87/34.38 [2019-03-28 12:37:20,982 INFO L71 MaximizeFinalStates]: 0 new accepting states 67.87/34.38 [2019-03-28 12:37:21,032 INFO L100 BaseMinimizeStates]: Removed 18 edges and 9 locations by large block encoding 67.87/34.38 [2019-03-28 12:37:21,035 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 67.87/34.38 [2019-03-28 12:37:21,037 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 67.87/34.38 [2019-03-28 12:37:21,037 INFO L71 MaximizeFinalStates]: 0 new accepting states 67.87/34.38 [2019-03-28 12:37:21,038 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 67.87/34.38 [2019-03-28 12:37:21,038 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 67.87/34.38 [2019-03-28 12:37:21,039 INFO L313 BlockEncoder]: Encoded RCFG 48 locations, 86 edges 67.87/34.38 [2019-03-28 12:37:21,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:37:21 BasicIcfg 67.87/34.38 [2019-03-28 12:37:21,039 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 67.87/34.38 [2019-03-28 12:37:21,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 67.87/34.38 [2019-03-28 12:37:21,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... 67.87/34.38 [2019-03-28 12:37:21,044 INFO L276 PluginConnector]: TraceAbstraction initialized 67.87/34.38 [2019-03-28 12:37:21,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:37:20" (1/4) ... 67.87/34.38 [2019-03-28 12:37:21,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455aeaef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:37:21, skipping insertion in model container 67.87/34.38 [2019-03-28 12:37:21,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:20" (2/4) ... 67.87/34.38 [2019-03-28 12:37:21,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455aeaef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:37:21, skipping insertion in model container 67.87/34.38 [2019-03-28 12:37:21,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:37:20" (3/4) ... 67.87/34.38 [2019-03-28 12:37:21,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455aeaef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:37:21, skipping insertion in model container 67.87/34.38 [2019-03-28 12:37:21,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:37:21" (4/4) ... 67.87/34.38 [2019-03-28 12:37:21,048 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 67.87/34.38 [2019-03-28 12:37:21,058 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 67.87/34.38 [2019-03-28 12:37:21,067 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 26 error locations. 67.87/34.38 [2019-03-28 12:37:21,084 INFO L257 AbstractCegarLoop]: Starting to check reachability of 26 error locations. 67.87/34.38 [2019-03-28 12:37:21,113 INFO L133 ementStrategyFactory]: Using default assertion order modulation 67.87/34.38 [2019-03-28 12:37:21,114 INFO L382 AbstractCegarLoop]: Interprodecural is true 67.87/34.38 [2019-03-28 12:37:21,114 INFO L383 AbstractCegarLoop]: Hoare is true 67.87/34.38 [2019-03-28 12:37:21,114 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 67.87/34.38 [2019-03-28 12:37:21,114 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 67.87/34.38 [2019-03-28 12:37:21,114 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 67.87/34.38 [2019-03-28 12:37:21,114 INFO L387 AbstractCegarLoop]: Difference is false 67.87/34.38 [2019-03-28 12:37:21,115 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 67.87/34.38 [2019-03-28 12:37:21,115 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 67.87/34.38 [2019-03-28 12:37:21,131 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. 67.87/34.38 [2019-03-28 12:37:21,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 67.87/34.38 [2019-03-28 12:37:21,137 INFO L394 BasicCegarLoop]: Found error trace 67.87/34.38 [2019-03-28 12:37:21,138 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 67.87/34.38 [2019-03-28 12:37:21,138 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 67.87/34.38 [2019-03-28 12:37:21,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.87/34.38 [2019-03-28 12:37:21,144 INFO L82 PathProgramCache]: Analyzing trace with hash 151003, now seen corresponding path program 1 times 67.87/34.38 [2019-03-28 12:37:21,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.87/34.38 [2019-03-28 12:37:21,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.87/34.38 [2019-03-28 12:37:21,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:21,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:21,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.87/34.38 [2019-03-28 12:37:21,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.87/34.38 [2019-03-28 12:37:21,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.87/34.38 [2019-03-28 12:37:21,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 67.87/34.38 [2019-03-28 12:37:21,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 67.87/34.38 [2019-03-28 12:37:21,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 67.87/34.38 [2019-03-28 12:37:21,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 67.87/34.38 [2019-03-28 12:37:21,343 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. 67.87/34.38 [2019-03-28 12:37:21,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.87/34.38 [2019-03-28 12:37:21,526 INFO L93 Difference]: Finished difference Result 48 states and 86 transitions. 67.87/34.38 [2019-03-28 12:37:21,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 67.87/34.38 [2019-03-28 12:37:21,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 67.87/34.38 [2019-03-28 12:37:21,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.87/34.38 [2019-03-28 12:37:21,542 INFO L225 Difference]: With dead ends: 48 67.87/34.38 [2019-03-28 12:37:21,542 INFO L226 Difference]: Without dead ends: 41 67.87/34.38 [2019-03-28 12:37:21,546 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 67.87/34.38 [2019-03-28 12:37:21,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. 67.87/34.38 [2019-03-28 12:37:21,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. 67.87/34.38 [2019-03-28 12:37:21,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. 67.87/34.38 [2019-03-28 12:37:21,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 72 transitions. 67.87/34.38 [2019-03-28 12:37:21,587 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 72 transitions. Word has length 3 67.87/34.38 [2019-03-28 12:37:21,588 INFO L84 Accepts]: Finished accepts. word is rejected. 67.87/34.38 [2019-03-28 12:37:21,588 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 72 transitions. 67.87/34.38 [2019-03-28 12:37:21,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 67.87/34.38 [2019-03-28 12:37:21,588 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 72 transitions. 67.87/34.38 [2019-03-28 12:37:21,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 67.87/34.38 [2019-03-28 12:37:21,589 INFO L394 BasicCegarLoop]: Found error trace 67.87/34.38 [2019-03-28 12:37:21,589 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 67.87/34.38 [2019-03-28 12:37:21,589 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 67.87/34.38 [2019-03-28 12:37:21,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.87/34.38 [2019-03-28 12:37:21,590 INFO L82 PathProgramCache]: Analyzing trace with hash 151005, now seen corresponding path program 1 times 67.87/34.38 [2019-03-28 12:37:21,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.87/34.38 [2019-03-28 12:37:21,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.87/34.38 [2019-03-28 12:37:21,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:21,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:21,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.87/34.38 [2019-03-28 12:37:21,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.87/34.38 [2019-03-28 12:37:21,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.87/34.38 [2019-03-28 12:37:21,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 67.87/34.38 [2019-03-28 12:37:21,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 67.87/34.38 [2019-03-28 12:37:21,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 67.87/34.38 [2019-03-28 12:37:21,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 67.87/34.38 [2019-03-28 12:37:21,613 INFO L87 Difference]: Start difference. First operand 41 states and 72 transitions. Second operand 3 states. 67.87/34.38 [2019-03-28 12:37:21,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.87/34.38 [2019-03-28 12:37:21,713 INFO L93 Difference]: Finished difference Result 48 states and 72 transitions. 67.87/34.38 [2019-03-28 12:37:21,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 67.87/34.38 [2019-03-28 12:37:21,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 67.87/34.38 [2019-03-28 12:37:21,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.87/34.38 [2019-03-28 12:37:21,715 INFO L225 Difference]: With dead ends: 48 67.87/34.38 [2019-03-28 12:37:21,715 INFO L226 Difference]: Without dead ends: 41 67.87/34.38 [2019-03-28 12:37:21,716 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 67.87/34.38 [2019-03-28 12:37:21,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. 67.87/34.38 [2019-03-28 12:37:21,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. 67.87/34.38 [2019-03-28 12:37:21,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. 67.87/34.38 [2019-03-28 12:37:21,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 65 transitions. 67.87/34.38 [2019-03-28 12:37:21,722 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 65 transitions. Word has length 3 67.87/34.38 [2019-03-28 12:37:21,722 INFO L84 Accepts]: Finished accepts. word is rejected. 67.87/34.38 [2019-03-28 12:37:21,722 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 65 transitions. 67.87/34.38 [2019-03-28 12:37:21,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 67.87/34.38 [2019-03-28 12:37:21,723 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 65 transitions. 67.87/34.38 [2019-03-28 12:37:21,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 67.87/34.38 [2019-03-28 12:37:21,723 INFO L394 BasicCegarLoop]: Found error trace 67.87/34.38 [2019-03-28 12:37:21,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 67.87/34.38 [2019-03-28 12:37:21,723 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 67.87/34.38 [2019-03-28 12:37:21,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.87/34.38 [2019-03-28 12:37:21,724 INFO L82 PathProgramCache]: Analyzing trace with hash 151006, now seen corresponding path program 1 times 67.87/34.38 [2019-03-28 12:37:21,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.87/34.38 [2019-03-28 12:37:21,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.87/34.38 [2019-03-28 12:37:21,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:21,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:21,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.87/34.38 [2019-03-28 12:37:21,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.87/34.38 [2019-03-28 12:37:21,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.87/34.38 [2019-03-28 12:37:21,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 67.87/34.38 [2019-03-28 12:37:21,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 67.87/34.38 [2019-03-28 12:37:21,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 67.87/34.38 [2019-03-28 12:37:21,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 67.87/34.38 [2019-03-28 12:37:21,766 INFO L87 Difference]: Start difference. First operand 41 states and 65 transitions. Second operand 3 states. 67.87/34.38 [2019-03-28 12:37:21,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.87/34.38 [2019-03-28 12:37:21,854 INFO L93 Difference]: Finished difference Result 41 states and 65 transitions. 67.87/34.38 [2019-03-28 12:37:21,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 67.87/34.38 [2019-03-28 12:37:21,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 67.87/34.38 [2019-03-28 12:37:21,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.87/34.38 [2019-03-28 12:37:21,856 INFO L225 Difference]: With dead ends: 41 67.87/34.38 [2019-03-28 12:37:21,856 INFO L226 Difference]: Without dead ends: 34 67.87/34.38 [2019-03-28 12:37:21,856 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 67.87/34.38 [2019-03-28 12:37:21,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. 67.87/34.38 [2019-03-28 12:37:21,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. 67.87/34.38 [2019-03-28 12:37:21,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 67.87/34.38 [2019-03-28 12:37:21,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 58 transitions. 67.87/34.38 [2019-03-28 12:37:21,861 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 58 transitions. Word has length 3 67.87/34.38 [2019-03-28 12:37:21,861 INFO L84 Accepts]: Finished accepts. word is rejected. 67.87/34.38 [2019-03-28 12:37:21,861 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 58 transitions. 67.87/34.38 [2019-03-28 12:37:21,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 67.87/34.38 [2019-03-28 12:37:21,862 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 58 transitions. 67.87/34.38 [2019-03-28 12:37:21,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 67.87/34.38 [2019-03-28 12:37:21,862 INFO L394 BasicCegarLoop]: Found error trace 67.87/34.38 [2019-03-28 12:37:21,862 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 67.87/34.38 [2019-03-28 12:37:21,863 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 67.87/34.38 [2019-03-28 12:37:21,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.87/34.38 [2019-03-28 12:37:21,863 INFO L82 PathProgramCache]: Analyzing trace with hash 202500096, now seen corresponding path program 1 times 67.87/34.38 [2019-03-28 12:37:21,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.87/34.38 [2019-03-28 12:37:21,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.87/34.38 [2019-03-28 12:37:21,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:21,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:21,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.87/34.38 [2019-03-28 12:37:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.87/34.38 [2019-03-28 12:37:21,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.87/34.38 [2019-03-28 12:37:21,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 67.87/34.38 [2019-03-28 12:37:21,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 67.87/34.38 [2019-03-28 12:37:21,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 67.87/34.38 [2019-03-28 12:37:21,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 67.87/34.38 [2019-03-28 12:37:21,904 INFO L87 Difference]: Start difference. First operand 34 states and 58 transitions. Second operand 3 states. 67.87/34.38 [2019-03-28 12:37:21,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.87/34.38 [2019-03-28 12:37:21,997 INFO L93 Difference]: Finished difference Result 34 states and 58 transitions. 67.87/34.38 [2019-03-28 12:37:21,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 67.87/34.38 [2019-03-28 12:37:21,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 67.87/34.38 [2019-03-28 12:37:21,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.87/34.38 [2019-03-28 12:37:21,998 INFO L225 Difference]: With dead ends: 34 67.87/34.38 [2019-03-28 12:37:21,998 INFO L226 Difference]: Without dead ends: 28 67.87/34.38 [2019-03-28 12:37:21,999 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 67.87/34.38 [2019-03-28 12:37:21,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 67.87/34.38 [2019-03-28 12:37:22,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 67.87/34.38 [2019-03-28 12:37:22,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 67.87/34.38 [2019-03-28 12:37:22,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 46 transitions. 67.87/34.38 [2019-03-28 12:37:22,003 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 46 transitions. Word has length 6 67.87/34.38 [2019-03-28 12:37:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. 67.87/34.38 [2019-03-28 12:37:22,003 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 46 transitions. 67.87/34.38 [2019-03-28 12:37:22,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 67.87/34.38 [2019-03-28 12:37:22,004 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 46 transitions. 67.87/34.38 [2019-03-28 12:37:22,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 67.87/34.38 [2019-03-28 12:37:22,004 INFO L394 BasicCegarLoop]: Found error trace 67.87/34.38 [2019-03-28 12:37:22,004 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 67.87/34.38 [2019-03-28 12:37:22,005 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 67.87/34.38 [2019-03-28 12:37:22,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.87/34.38 [2019-03-28 12:37:22,005 INFO L82 PathProgramCache]: Analyzing trace with hash 202500098, now seen corresponding path program 1 times 67.87/34.38 [2019-03-28 12:37:22,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.87/34.38 [2019-03-28 12:37:22,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.87/34.38 [2019-03-28 12:37:22,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:22,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:22,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.87/34.38 [2019-03-28 12:37:22,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.87/34.38 [2019-03-28 12:37:22,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.87/34.38 [2019-03-28 12:37:22,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 67.87/34.38 [2019-03-28 12:37:22,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 67.87/34.38 [2019-03-28 12:37:22,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 67.87/34.38 [2019-03-28 12:37:22,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 67.87/34.38 [2019-03-28 12:37:22,032 INFO L87 Difference]: Start difference. First operand 28 states and 46 transitions. Second operand 3 states. 67.87/34.38 [2019-03-28 12:37:22,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.87/34.38 [2019-03-28 12:37:22,092 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. 67.87/34.38 [2019-03-28 12:37:22,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 67.87/34.38 [2019-03-28 12:37:22,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 67.87/34.38 [2019-03-28 12:37:22,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.87/34.38 [2019-03-28 12:37:22,093 INFO L225 Difference]: With dead ends: 34 67.87/34.38 [2019-03-28 12:37:22,093 INFO L226 Difference]: Without dead ends: 28 67.87/34.38 [2019-03-28 12:37:22,094 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 67.87/34.38 [2019-03-28 12:37:22,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 67.87/34.38 [2019-03-28 12:37:22,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 67.87/34.38 [2019-03-28 12:37:22,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 67.87/34.38 [2019-03-28 12:37:22,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. 67.87/34.38 [2019-03-28 12:37:22,097 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 6 67.87/34.38 [2019-03-28 12:37:22,098 INFO L84 Accepts]: Finished accepts. word is rejected. 67.87/34.38 [2019-03-28 12:37:22,098 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. 67.87/34.38 [2019-03-28 12:37:22,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 67.87/34.38 [2019-03-28 12:37:22,098 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. 67.87/34.38 [2019-03-28 12:37:22,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 67.87/34.38 [2019-03-28 12:37:22,099 INFO L394 BasicCegarLoop]: Found error trace 67.87/34.38 [2019-03-28 12:37:22,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 67.87/34.38 [2019-03-28 12:37:22,099 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 67.87/34.38 [2019-03-28 12:37:22,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.87/34.38 [2019-03-28 12:37:22,100 INFO L82 PathProgramCache]: Analyzing trace with hash 202500099, now seen corresponding path program 1 times 67.87/34.38 [2019-03-28 12:37:22,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.87/34.38 [2019-03-28 12:37:22,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.87/34.38 [2019-03-28 12:37:22,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:22,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:22,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.87/34.38 [2019-03-28 12:37:22,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.87/34.38 [2019-03-28 12:37:22,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.87/34.38 [2019-03-28 12:37:22,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 67.87/34.38 [2019-03-28 12:37:22,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 67.87/34.38 [2019-03-28 12:37:22,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 67.87/34.38 [2019-03-28 12:37:22,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 67.87/34.38 [2019-03-28 12:37:22,134 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 3 states. 67.87/34.38 [2019-03-28 12:37:22,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.87/34.38 [2019-03-28 12:37:22,185 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. 67.87/34.38 [2019-03-28 12:37:22,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 67.87/34.38 [2019-03-28 12:37:22,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 67.87/34.38 [2019-03-28 12:37:22,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.87/34.38 [2019-03-28 12:37:22,186 INFO L225 Difference]: With dead ends: 28 67.87/34.38 [2019-03-28 12:37:22,186 INFO L226 Difference]: Without dead ends: 0 67.87/34.38 [2019-03-28 12:37:22,187 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 67.87/34.38 [2019-03-28 12:37:22,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 67.87/34.38 [2019-03-28 12:37:22,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 67.87/34.38 [2019-03-28 12:37:22,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 67.87/34.38 [2019-03-28 12:37:22,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 67.87/34.38 [2019-03-28 12:37:22,188 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 67.87/34.38 [2019-03-28 12:37:22,188 INFO L84 Accepts]: Finished accepts. word is rejected. 67.87/34.38 [2019-03-28 12:37:22,189 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 67.87/34.38 [2019-03-28 12:37:22,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 67.87/34.38 [2019-03-28 12:37:22,189 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 67.87/34.38 [2019-03-28 12:37:22,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 67.87/34.38 [2019-03-28 12:37:22,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 67.87/34.38 [2019-03-28 12:37:22,218 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,218 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,218 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,218 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,218 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,218 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,219 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,219 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,219 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,219 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,219 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,219 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,219 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,220 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,220 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,220 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,220 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,220 INFO L448 ceAbstractionStarter]: For program point L8-1(line 8) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,220 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,221 INFO L448 ceAbstractionStarter]: For program point L8-2(line 8) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,221 INFO L448 ceAbstractionStarter]: For program point L8-3(line 8) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,221 INFO L448 ceAbstractionStarter]: For program point L8-4(line 8) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,221 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,221 INFO L448 ceAbstractionStarter]: For program point L8-6(lines 8 24) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,221 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,222 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,222 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,222 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,222 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,222 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 22) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,223 INFO L444 ceAbstractionStarter]: At program point L17-2(lines 8 24) the Hoare annotation is: (and (= (select |#valid| ULTIMATE.start_main_~y~0.base) 1) (= (select |#length| ULTIMATE.start_main_~y~0.base) 4) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= ULTIMATE.start_main_~x~0.offset 0) (= 4 (select |#length| ULTIMATE.start_main_~x~0.base)) (= ULTIMATE.start_main_~y~0.offset 0)) 67.87/34.38 [2019-03-28 12:37:22,223 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,223 INFO L448 ceAbstractionStarter]: For program point L9-1(lines 9 23) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,223 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,223 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,223 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,223 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,224 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,224 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,224 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,224 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,224 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,224 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,224 INFO L448 ceAbstractionStarter]: For program point L10(lines 10 15) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,224 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,225 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,225 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,225 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 67.87/34.38 [2019-03-28 12:37:22,225 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 67.87/34.38 [2019-03-28 12:37:22,234 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.87/34.38 [2019-03-28 12:37:22,235 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.87/34.38 [2019-03-28 12:37:22,241 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.87/34.38 [2019-03-28 12:37:22,242 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.87/34.38 [2019-03-28 12:37:22,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:37:22 BasicIcfg 67.87/34.38 [2019-03-28 12:37:22,244 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 67.87/34.38 [2019-03-28 12:37:22,245 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 67.87/34.38 [2019-03-28 12:37:22,245 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 67.87/34.38 [2019-03-28 12:37:22,248 INFO L276 PluginConnector]: BuchiAutomizer initialized 67.87/34.38 [2019-03-28 12:37:22,249 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 67.87/34.38 [2019-03-28 12:37:22,249 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:37:20" (1/5) ... 67.87/34.38 [2019-03-28 12:37:22,250 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1700d17f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:37:22, skipping insertion in model container 67.87/34.38 [2019-03-28 12:37:22,250 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 67.87/34.38 [2019-03-28 12:37:22,250 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:20" (2/5) ... 67.87/34.38 [2019-03-28 12:37:22,250 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1700d17f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:37:22, skipping insertion in model container 67.87/34.38 [2019-03-28 12:37:22,250 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 67.87/34.38 [2019-03-28 12:37:22,251 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:37:20" (3/5) ... 67.87/34.38 [2019-03-28 12:37:22,251 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1700d17f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:37:22, skipping insertion in model container 67.87/34.38 [2019-03-28 12:37:22,251 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 67.87/34.38 [2019-03-28 12:37:22,251 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:37:21" (4/5) ... 67.87/34.38 [2019-03-28 12:37:22,251 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1700d17f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:37:22, skipping insertion in model container 67.87/34.38 [2019-03-28 12:37:22,252 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 67.87/34.38 [2019-03-28 12:37:22,252 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:37:22" (5/5) ... 67.87/34.38 [2019-03-28 12:37:22,253 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 67.87/34.38 [2019-03-28 12:37:22,275 INFO L133 ementStrategyFactory]: Using default assertion order modulation 67.87/34.38 [2019-03-28 12:37:22,276 INFO L374 BuchiCegarLoop]: Interprodecural is true 67.87/34.38 [2019-03-28 12:37:22,276 INFO L375 BuchiCegarLoop]: Hoare is true 67.87/34.38 [2019-03-28 12:37:22,276 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 67.87/34.38 [2019-03-28 12:37:22,276 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 67.87/34.38 [2019-03-28 12:37:22,276 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 67.87/34.38 [2019-03-28 12:37:22,276 INFO L379 BuchiCegarLoop]: Difference is false 67.87/34.38 [2019-03-28 12:37:22,276 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 67.87/34.38 [2019-03-28 12:37:22,277 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 67.87/34.38 [2019-03-28 12:37:22,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states. 67.87/34.38 [2019-03-28 12:37:22,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 67.87/34.38 [2019-03-28 12:37:22,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 67.87/34.38 [2019-03-28 12:37:22,288 INFO L119 BuchiIsEmpty]: Starting construction of run 67.87/34.38 [2019-03-28 12:37:22,292 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 67.87/34.38 [2019-03-28 12:37:22,292 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 67.87/34.38 [2019-03-28 12:37:22,292 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 67.87/34.38 [2019-03-28 12:37:22,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states. 67.87/34.38 [2019-03-28 12:37:22,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 67.87/34.38 [2019-03-28 12:37:22,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 67.87/34.38 [2019-03-28 12:37:22,295 INFO L119 BuchiIsEmpty]: Starting construction of run 67.87/34.38 [2019-03-28 12:37:22,296 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 67.87/34.38 [2019-03-28 12:37:22,296 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 67.87/34.38 [2019-03-28 12:37:22,301 INFO L794 eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRYtrue [120] 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] 14#L-1true [187] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 28#L17-2true 67.87/34.38 [2019-03-28 12:37:22,302 INFO L796 eck$LassoCheckResult]: Loop: 28#L17-2true [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 35#L8-1true [192] L8-1-->L8-2: Formula: (and (< |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 33#L8-2true [115] L8-2-->L8-6: Formula: (not |v_ULTIMATE.start_main_#t~short4_5|) InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} AuxVars[] AssignedVars[] 48#L8-6true [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 12#L9true [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 9#L9-1true [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 16#L10true [99] L10-->L14: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet6_5|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_5|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 25#L14true [108] L14-->L14-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~y~0.base_10)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8) |v_ULTIMATE.start_main_#t~mem9_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_16| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 24#L14-1true [252] L14-1-->L17-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1)))) |v_#memory_int_20|) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_22)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_30| v_ULTIMATE.start_main_~y~0.base_22))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 28#L17-2true 67.87/34.38 [2019-03-28 12:37:22,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.87/34.38 [2019-03-28 12:37:22,303 INFO L82 PathProgramCache]: Analyzing trace with hash 4868, now seen corresponding path program 1 times 67.87/34.38 [2019-03-28 12:37:22,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.87/34.38 [2019-03-28 12:37:22,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.87/34.38 [2019-03-28 12:37:22,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:22,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:22,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.38 [2019-03-28 12:37:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.38 [2019-03-28 12:37:22,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.87/34.38 [2019-03-28 12:37:22,341 INFO L82 PathProgramCache]: Analyzing trace with hash 239903326, now seen corresponding path program 1 times 67.87/34.38 [2019-03-28 12:37:22,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.87/34.38 [2019-03-28 12:37:22,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.87/34.38 [2019-03-28 12:37:22,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:22,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:22,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.87/34.38 [2019-03-28 12:37:22,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.87/34.38 [2019-03-28 12:37:22,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.87/34.38 [2019-03-28 12:37:22,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 67.87/34.38 [2019-03-28 12:37:22,357 INFO L811 eck$LassoCheckResult]: loop already infeasible 67.87/34.38 [2019-03-28 12:37:22,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 67.87/34.38 [2019-03-28 12:37:22,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 67.87/34.38 [2019-03-28 12:37:22,359 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. 67.87/34.38 [2019-03-28 12:37:22,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.87/34.38 [2019-03-28 12:37:22,489 INFO L93 Difference]: Finished difference Result 50 states and 88 transitions. 67.87/34.38 [2019-03-28 12:37:22,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 67.87/34.38 [2019-03-28 12:37:22,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 88 transitions. 67.87/34.38 [2019-03-28 12:37:22,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 67.87/34.38 [2019-03-28 12:37:22,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 24 states and 36 transitions. 67.87/34.38 [2019-03-28 12:37:22,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 67.87/34.38 [2019-03-28 12:37:22,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 67.87/34.38 [2019-03-28 12:37:22,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 36 transitions. 67.87/34.38 [2019-03-28 12:37:22,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 67.87/34.38 [2019-03-28 12:37:22,498 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. 67.87/34.38 [2019-03-28 12:37:22,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 36 transitions. 67.87/34.38 [2019-03-28 12:37:22,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. 67.87/34.38 [2019-03-28 12:37:22,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 67.87/34.38 [2019-03-28 12:37:22,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. 67.87/34.38 [2019-03-28 12:37:22,501 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. 67.87/34.38 [2019-03-28 12:37:22,501 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. 67.87/34.38 [2019-03-28 12:37:22,501 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 67.87/34.38 [2019-03-28 12:37:22,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. 67.87/34.38 [2019-03-28 12:37:22,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 67.87/34.38 [2019-03-28 12:37:22,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 67.87/34.38 [2019-03-28 12:37:22,502 INFO L119 BuchiIsEmpty]: Starting construction of run 67.87/34.38 [2019-03-28 12:37:22,502 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 67.87/34.38 [2019-03-28 12:37:22,502 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 67.87/34.38 [2019-03-28 12:37:22,503 INFO L794 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY [120] 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] 122#L-1 [187] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 107#L17-2 67.87/34.38 [2019-03-28 12:37:22,504 INFO L796 eck$LassoCheckResult]: Loop: 107#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 108#L8-1 [194] L8-1-->L8-2: Formula: (and (not |v_ULTIMATE.start_main_#t~short4_2|) (= |v_ULTIMATE.start_main_#t~mem2_3| 0)) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 116#L8-2 [115] L8-2-->L8-6: Formula: (not |v_ULTIMATE.start_main_#t~short4_5|) InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} AuxVars[] AssignedVars[] 128#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 121#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 117#L9-1 [161] L9-1-->L17: Formula: (>= 0 |v_ULTIMATE.start_main_#t~mem5_6|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 112#L17 [208] L17-->L18: Formula: (> |v_ULTIMATE.start_main_#t~nondet10_3| 0) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_3|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10] 113#L18 [93] L18-->L18-1: Formula: (and (= (select |v_#valid_22| v_ULTIMATE.start_main_~x~0.base_16) 1) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_20| v_ULTIMATE.start_main_~x~0.base_16)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12) |v_ULTIMATE.start_main_#t~mem11_2|)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 115#L18-1 [255] L18-1-->L17-2: Formula: (and (= |v_#memory_int_26| (store |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26) v_ULTIMATE.start_main_~x~0.offset_19 (+ |v_ULTIMATE.start_main_#t~mem11_6| 1)))) (= 1 (select |v_#valid_44| v_ULTIMATE.start_main_~x~0.base_26)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_19) (<= (+ v_ULTIMATE.start_main_~x~0.offset_19 4) (select |v_#length_33| v_ULTIMATE.start_main_~x~0.base_26))) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, #memory_int] 107#L17-2 67.87/34.38 [2019-03-28 12:37:22,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.87/34.38 [2019-03-28 12:37:22,504 INFO L82 PathProgramCache]: Analyzing trace with hash 4868, now seen corresponding path program 2 times 67.87/34.38 [2019-03-28 12:37:22,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.87/34.38 [2019-03-28 12:37:22,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.87/34.38 [2019-03-28 12:37:22,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:22,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:22,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.38 [2019-03-28 12:37:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.38 [2019-03-28 12:37:22,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.87/34.38 [2019-03-28 12:37:22,521 INFO L82 PathProgramCache]: Analyzing trace with hash -568415492, now seen corresponding path program 1 times 67.87/34.38 [2019-03-28 12:37:22,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.87/34.38 [2019-03-28 12:37:22,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.87/34.38 [2019-03-28 12:37:22,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:22,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 67.87/34.38 [2019-03-28 12:37:22,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.87/34.39 [2019-03-28 12:37:22,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.87/34.39 [2019-03-28 12:37:22,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.87/34.39 [2019-03-28 12:37:22,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 67.87/34.39 [2019-03-28 12:37:22,534 INFO L811 eck$LassoCheckResult]: loop already infeasible 67.87/34.39 [2019-03-28 12:37:22,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 67.87/34.39 [2019-03-28 12:37:22,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 67.87/34.39 [2019-03-28 12:37:22,534 INFO L87 Difference]: Start difference. First operand 23 states and 35 transitions. cyclomatic complexity: 13 Second operand 3 states. 67.87/34.39 [2019-03-28 12:37:22,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.87/34.39 [2019-03-28 12:37:22,566 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. 67.87/34.39 [2019-03-28 12:37:22,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 67.87/34.39 [2019-03-28 12:37:22,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 34 transitions. 67.87/34.39 [2019-03-28 12:37:22,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 67.87/34.39 [2019-03-28 12:37:22,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 31 transitions. 67.87/34.39 [2019-03-28 12:37:22,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 67.87/34.39 [2019-03-28 12:37:22,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 67.87/34.39 [2019-03-28 12:37:22,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. 67.87/34.39 [2019-03-28 12:37:22,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 67.87/34.39 [2019-03-28 12:37:22,569 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. 67.87/34.39 [2019-03-28 12:37:22,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. 67.87/34.39 [2019-03-28 12:37:22,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. 67.87/34.39 [2019-03-28 12:37:22,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 67.87/34.39 [2019-03-28 12:37:22,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. 67.87/34.39 [2019-03-28 12:37:22,571 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. 67.87/34.39 [2019-03-28 12:37:22,572 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. 67.87/34.39 [2019-03-28 12:37:22,572 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 67.87/34.39 [2019-03-28 12:37:22,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. 67.87/34.39 [2019-03-28 12:37:22,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 67.87/34.39 [2019-03-28 12:37:22,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 67.87/34.39 [2019-03-28 12:37:22,573 INFO L119 BuchiIsEmpty]: Starting construction of run 67.87/34.39 [2019-03-28 12:37:22,573 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 67.87/34.39 [2019-03-28 12:37:22,573 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 67.87/34.39 [2019-03-28 12:37:22,574 INFO L794 eck$LassoCheckResult]: Stem: 179#ULTIMATE.startENTRY [120] 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] 174#L-1 [187] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 160#L17-2 67.87/34.39 [2019-03-28 12:37:22,574 INFO L796 eck$LassoCheckResult]: Loop: 160#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 161#L8-1 [192] L8-1-->L8-2: Formula: (and (< |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 164#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 162#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 163#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 180#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 173#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 169#L9-1 [161] L9-1-->L17: Formula: (>= 0 |v_ULTIMATE.start_main_#t~mem5_6|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 165#L17 [208] L17-->L18: Formula: (> |v_ULTIMATE.start_main_#t~nondet10_3| 0) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_3|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10] 166#L18 [93] L18-->L18-1: Formula: (and (= (select |v_#valid_22| v_ULTIMATE.start_main_~x~0.base_16) 1) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_20| v_ULTIMATE.start_main_~x~0.base_16)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12) |v_ULTIMATE.start_main_#t~mem11_2|)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 168#L18-1 [255] L18-1-->L17-2: Formula: (and (= |v_#memory_int_26| (store |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26) v_ULTIMATE.start_main_~x~0.offset_19 (+ |v_ULTIMATE.start_main_#t~mem11_6| 1)))) (= 1 (select |v_#valid_44| v_ULTIMATE.start_main_~x~0.base_26)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_19) (<= (+ v_ULTIMATE.start_main_~x~0.offset_19 4) (select |v_#length_33| v_ULTIMATE.start_main_~x~0.base_26))) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, #memory_int] 160#L17-2 67.87/34.39 [2019-03-28 12:37:22,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.87/34.39 [2019-03-28 12:37:22,575 INFO L82 PathProgramCache]: Analyzing trace with hash 4868, now seen corresponding path program 3 times 67.87/34.39 [2019-03-28 12:37:22,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.87/34.39 [2019-03-28 12:37:22,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.87/34.39 [2019-03-28 12:37:22,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:22,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:22,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:22,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.87/34.39 [2019-03-28 12:37:22,590 INFO L82 PathProgramCache]: Analyzing trace with hash 939896181, now seen corresponding path program 1 times 67.87/34.39 [2019-03-28 12:37:22,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.87/34.39 [2019-03-28 12:37:22,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.87/34.39 [2019-03-28 12:37:22,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:22,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:22,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:22,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.87/34.39 [2019-03-28 12:37:22,609 INFO L82 PathProgramCache]: Analyzing trace with hash 2120264338, now seen corresponding path program 1 times 67.87/34.39 [2019-03-28 12:37:22,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.87/34.39 [2019-03-28 12:37:22,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.87/34.39 [2019-03-28 12:37:22,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:22,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:22,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:22,860 INFO L216 LassoAnalysis]: Preferences: 67.87/34.39 [2019-03-28 12:37:22,861 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 67.87/34.39 [2019-03-28 12:37:22,861 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 67.87/34.39 [2019-03-28 12:37:22,861 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 67.87/34.39 [2019-03-28 12:37:22,861 INFO L127 ssoRankerPreferences]: Use exernal solver: false 67.87/34.39 [2019-03-28 12:37:22,862 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 67.87/34.39 [2019-03-28 12:37:22,862 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 67.87/34.39 [2019-03-28 12:37:22,862 INFO L130 ssoRankerPreferences]: Path of dumped script: 67.87/34.39 [2019-03-28 12:37:22,862 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 67.87/34.39 [2019-03-28 12:37:22,862 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 67.87/34.39 [2019-03-28 12:37:22,862 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 67.87/34.39 [2019-03-28 12:37:22,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:22,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:22,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:22,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:22,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:22,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:22,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:22,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:22,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:23,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:23,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:23,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:23,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:23,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:23,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:23,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:23,367 INFO L300 LassoAnalysis]: Preprocessing complete. 67.87/34.39 [2019-03-28 12:37:23,372 INFO L497 LassoAnalysis]: Using template 'affine'. 67.87/34.39 [2019-03-28 12:37:23,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:23,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:23,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:23,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:23,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:23,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:23,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:23,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:23,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:23,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:23,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:23,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:23,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:23,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:23,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:23,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:23,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:23,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:23,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:23,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:23,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:23,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:23,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:23,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:23,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:23,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:23,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:23,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:23,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:23,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:23,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:23,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:23,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:23,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:23,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:23,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:23,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:23,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:23,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:23,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:23,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:23,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:23,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:23,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:23,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:23,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:23,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:23,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:23,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:23,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:23,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:23,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:23,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:23,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:23,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:23,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:23,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:23,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:23,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:23,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:23,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:23,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:23,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:23,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:23,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:23,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:23,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:23,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:23,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:23,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:23,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:23,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:23,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:23,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:23,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:23,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:23,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:23,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:23,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:23,411 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 67.87/34.39 [2019-03-28 12:37:23,416 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 67.87/34.39 [2019-03-28 12:37:23,416 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 67.87/34.39 [2019-03-28 12:37:23,418 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 67.87/34.39 [2019-03-28 12:37:23,418 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 67.87/34.39 [2019-03-28 12:37:23,419 INFO L518 LassoAnalysis]: Proved termination. 67.87/34.39 [2019-03-28 12:37:23,419 INFO L520 LassoAnalysis]: Termination argument consisting of: 67.87/34.39 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 67.87/34.39 Supporting invariants [] 67.87/34.39 [2019-03-28 12:37:23,445 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed 67.87/34.39 [2019-03-28 12:37:23,447 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.87/34.39 [2019-03-28 12:37:23,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.87/34.39 [2019-03-28 12:37:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.87/34.39 [2019-03-28 12:37:23,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core 67.87/34.39 [2019-03-28 12:37:23,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.87/34.39 [2019-03-28 12:37:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.87/34.39 [2019-03-28 12:37:23,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core 67.87/34.39 [2019-03-28 12:37:23,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.87/34.39 [2019-03-28 12:37:23,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.87/34.39 [2019-03-28 12:37:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.87/34.39 [2019-03-28 12:37:23,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core 67.87/34.39 [2019-03-28 12:37:23,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.87/34.39 [2019-03-28 12:37:23,683 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 30 treesize of output 18 67.87/34.39 [2019-03-28 12:37:23,684 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.87/34.39 [2019-03-28 12:37:23,691 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.87/34.39 [2019-03-28 12:37:23,692 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.87/34.39 [2019-03-28 12:37:23,693 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:9 67.87/34.39 [2019-03-28 12:37:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.87/34.39 [2019-03-28 12:37:23,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core 67.87/34.39 [2019-03-28 12:37:23,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.87/34.39 [2019-03-28 12:37:23,762 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 30 treesize of output 18 67.87/34.39 [2019-03-28 12:37:23,763 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.87/34.39 [2019-03-28 12:37:23,769 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.87/34.39 [2019-03-28 12:37:23,769 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.87/34.39 [2019-03-28 12:37:23,769 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:9 67.87/34.39 [2019-03-28 12:37:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:23,787 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 67.87/34.39 [2019-03-28 12:37:23,788 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 5 predicates after loop cannibalization 67.87/34.39 [2019-03-28 12:37:23,792 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates 67.87/34.39 [2019-03-28 12:37:23,793 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 22 states and 31 transitions. cyclomatic complexity: 10 Second operand 5 states. 67.87/34.39 [2019-03-28 12:37:24,137 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 22 states and 31 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 128 states and 163 transitions. Complement of second has 21 states. 67.87/34.39 [2019-03-28 12:37:24,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 9 non-accepting loop states 2 accepting loop states 67.87/34.39 [2019-03-28 12:37:24,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 67.87/34.39 [2019-03-28 12:37:24,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 93 transitions. 67.87/34.39 [2019-03-28 12:37:24,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 93 transitions. Stem has 2 letters. Loop has 11 letters. 67.87/34.39 [2019-03-28 12:37:24,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.87/34.39 [2019-03-28 12:37:24,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 93 transitions. Stem has 13 letters. Loop has 11 letters. 67.87/34.39 [2019-03-28 12:37:24,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.87/34.39 [2019-03-28 12:37:24,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 93 transitions. Stem has 2 letters. Loop has 22 letters. 67.87/34.39 [2019-03-28 12:37:24,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.87/34.39 [2019-03-28 12:37:24,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 163 transitions. 67.87/34.39 [2019-03-28 12:37:24,152 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 67.87/34.39 [2019-03-28 12:37:24,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 105 states and 136 transitions. 67.87/34.39 [2019-03-28 12:37:24,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 67.87/34.39 [2019-03-28 12:37:24,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 67.87/34.39 [2019-03-28 12:37:24,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 136 transitions. 67.87/34.39 [2019-03-28 12:37:24,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 67.87/34.39 [2019-03-28 12:37:24,155 INFO L706 BuchiCegarLoop]: Abstraction has 105 states and 136 transitions. 67.87/34.39 [2019-03-28 12:37:24,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 136 transitions. 67.87/34.39 [2019-03-28 12:37:24,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 65. 67.87/34.39 [2019-03-28 12:37:24,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. 67.87/34.39 [2019-03-28 12:37:24,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. 67.87/34.39 [2019-03-28 12:37:24,160 INFO L729 BuchiCegarLoop]: Abstraction has 65 states and 86 transitions. 67.87/34.39 [2019-03-28 12:37:24,160 INFO L609 BuchiCegarLoop]: Abstraction has 65 states and 86 transitions. 67.87/34.39 [2019-03-28 12:37:24,160 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 67.87/34.39 [2019-03-28 12:37:24,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 86 transitions. 67.87/34.39 [2019-03-28 12:37:24,161 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 67.87/34.39 [2019-03-28 12:37:24,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 67.87/34.39 [2019-03-28 12:37:24,162 INFO L119 BuchiIsEmpty]: Starting construction of run 67.87/34.39 [2019-03-28 12:37:24,162 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 67.87/34.39 [2019-03-28 12:37:24,162 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 67.87/34.39 [2019-03-28 12:37:24,163 INFO L794 eck$LassoCheckResult]: Stem: 550#ULTIMATE.startENTRY [120] 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] 544#L-1 [186] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 514#L17-2 67.87/34.39 [2019-03-28 12:37:24,163 INFO L796 eck$LassoCheckResult]: Loop: 514#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 515#L8-1 [192] L8-1-->L8-2: Formula: (and (< |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 570#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 578#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 577#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 576#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 575#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 574#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 537#L10 [99] L10-->L14: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet6_5|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_5|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 548#L14 [108] L14-->L14-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~y~0.base_10)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8) |v_ULTIMATE.start_main_#t~mem9_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_16| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 553#L14-1 [252] L14-1-->L17-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1)))) |v_#memory_int_20|) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_22)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_30| v_ULTIMATE.start_main_~y~0.base_22))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 514#L17-2 67.87/34.39 [2019-03-28 12:37:24,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.87/34.39 [2019-03-28 12:37:24,164 INFO L82 PathProgramCache]: Analyzing trace with hash 4867, now seen corresponding path program 1 times 67.87/34.39 [2019-03-28 12:37:24,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.87/34.39 [2019-03-28 12:37:24,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.87/34.39 [2019-03-28 12:37:24,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:24,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:24,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:24,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.87/34.39 [2019-03-28 12:37:24,176 INFO L82 PathProgramCache]: Analyzing trace with hash 938868373, now seen corresponding path program 1 times 67.87/34.39 [2019-03-28 12:37:24,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.87/34.39 [2019-03-28 12:37:24,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.87/34.39 [2019-03-28 12:37:24,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:24,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:24,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.87/34.39 [2019-03-28 12:37:24,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.87/34.39 [2019-03-28 12:37:24,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.87/34.39 [2019-03-28 12:37:24,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 67.87/34.39 [2019-03-28 12:37:24,218 INFO L811 eck$LassoCheckResult]: loop already infeasible 67.87/34.39 [2019-03-28 12:37:24,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 67.87/34.39 [2019-03-28 12:37:24,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 67.87/34.39 [2019-03-28 12:37:24,219 INFO L87 Difference]: Start difference. First operand 65 states and 86 transitions. cyclomatic complexity: 24 Second operand 5 states. 67.87/34.39 [2019-03-28 12:37:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.87/34.39 [2019-03-28 12:37:24,309 INFO L93 Difference]: Finished difference Result 76 states and 98 transitions. 67.87/34.39 [2019-03-28 12:37:24,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 67.87/34.39 [2019-03-28 12:37:24,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 98 transitions. 67.87/34.39 [2019-03-28 12:37:24,315 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 67.87/34.39 [2019-03-28 12:37:24,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 98 transitions. 67.87/34.39 [2019-03-28 12:37:24,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 67.87/34.39 [2019-03-28 12:37:24,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 67.87/34.39 [2019-03-28 12:37:24,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 98 transitions. 67.87/34.39 [2019-03-28 12:37:24,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 67.87/34.39 [2019-03-28 12:37:24,317 INFO L706 BuchiCegarLoop]: Abstraction has 76 states and 98 transitions. 67.87/34.39 [2019-03-28 12:37:24,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 98 transitions. 67.87/34.39 [2019-03-28 12:37:24,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. 67.87/34.39 [2019-03-28 12:37:24,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. 67.87/34.39 [2019-03-28 12:37:24,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. 67.87/34.39 [2019-03-28 12:37:24,323 INFO L729 BuchiCegarLoop]: Abstraction has 71 states and 91 transitions. 67.87/34.39 [2019-03-28 12:37:24,323 INFO L609 BuchiCegarLoop]: Abstraction has 71 states and 91 transitions. 67.87/34.39 [2019-03-28 12:37:24,323 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 67.87/34.39 [2019-03-28 12:37:24,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 91 transitions. 67.87/34.39 [2019-03-28 12:37:24,324 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 67.87/34.39 [2019-03-28 12:37:24,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 67.87/34.39 [2019-03-28 12:37:24,324 INFO L119 BuchiIsEmpty]: Starting construction of run 67.87/34.39 [2019-03-28 12:37:24,325 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 67.87/34.39 [2019-03-28 12:37:24,325 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 67.87/34.39 [2019-03-28 12:37:24,325 INFO L794 eck$LassoCheckResult]: Stem: 708#ULTIMATE.startENTRY [120] 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] 701#L-1 [186] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 683#L17-2 67.87/34.39 [2019-03-28 12:37:24,326 INFO L796 eck$LassoCheckResult]: Loop: 683#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 724#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 732#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 731#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 730#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 729#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 728#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 715#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 705#L10 [99] L10-->L14: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet6_5|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_5|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 706#L14 [108] L14-->L14-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~y~0.base_10)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8) |v_ULTIMATE.start_main_#t~mem9_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_16| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 712#L14-1 [252] L14-1-->L17-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1)))) |v_#memory_int_20|) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_22)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_30| v_ULTIMATE.start_main_~y~0.base_22))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 683#L17-2 67.87/34.39 [2019-03-28 12:37:24,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.87/34.39 [2019-03-28 12:37:24,326 INFO L82 PathProgramCache]: Analyzing trace with hash 4867, now seen corresponding path program 2 times 67.87/34.39 [2019-03-28 12:37:24,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.87/34.39 [2019-03-28 12:37:24,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.87/34.39 [2019-03-28 12:37:24,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:24,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:24,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:24,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.87/34.39 [2019-03-28 12:37:24,336 INFO L82 PathProgramCache]: Analyzing trace with hash 742354868, now seen corresponding path program 1 times 67.87/34.39 [2019-03-28 12:37:24,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.87/34.39 [2019-03-28 12:37:24,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.87/34.39 [2019-03-28 12:37:24,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:24,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:24,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:24,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.87/34.39 [2019-03-28 12:37:24,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1793640306, now seen corresponding path program 1 times 67.87/34.39 [2019-03-28 12:37:24,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.87/34.39 [2019-03-28 12:37:24,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.87/34.39 [2019-03-28 12:37:24,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:24,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:24,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:24,611 INFO L216 LassoAnalysis]: Preferences: 67.87/34.39 [2019-03-28 12:37:24,612 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 67.87/34.39 [2019-03-28 12:37:24,612 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 67.87/34.39 [2019-03-28 12:37:24,612 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 67.87/34.39 [2019-03-28 12:37:24,612 INFO L127 ssoRankerPreferences]: Use exernal solver: false 67.87/34.39 [2019-03-28 12:37:24,613 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 67.87/34.39 [2019-03-28 12:37:24,613 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 67.87/34.39 [2019-03-28 12:37:24,613 INFO L130 ssoRankerPreferences]: Path of dumped script: 67.87/34.39 [2019-03-28 12:37:24,613 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 67.87/34.39 [2019-03-28 12:37:24,613 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 67.87/34.39 [2019-03-28 12:37:24,613 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 67.87/34.39 [2019-03-28 12:37:24,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:24,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:24,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:24,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:24,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:24,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:24,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:24,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:24,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:24,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:24,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:24,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:24,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:24,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:24,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:24,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:25,083 INFO L300 LassoAnalysis]: Preprocessing complete. 67.87/34.39 [2019-03-28 12:37:25,084 INFO L497 LassoAnalysis]: Using template 'affine'. 67.87/34.39 [2019-03-28 12:37:25,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:25,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:25,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:25,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:25,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:25,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:25,086 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:25,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:25,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:25,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:25,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:25,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:25,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:25,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:25,089 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:25,089 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:25,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:25,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:25,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:25,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:25,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:25,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:25,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:25,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:25,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:25,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:25,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:25,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:25,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:25,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:25,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:25,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:25,096 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:25,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:25,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:25,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:25,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:25,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:25,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:25,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:25,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:25,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:25,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:25,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:25,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:25,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:25,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:25,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:25,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:25,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:25,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:25,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:25,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:25,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:25,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:25,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:25,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:25,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:25,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:25,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:25,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:25,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:25,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:25,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:25,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:25,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:25,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:25,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:25,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:25,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:25,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:25,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:25,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:25,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:25,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:25,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:25,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:25,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:25,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:25,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:25,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:25,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:25,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:25,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:25,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:25,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:25,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:25,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:25,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:25,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:25,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:25,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:25,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:25,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:25,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:25,127 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 67.87/34.39 [2019-03-28 12:37:25,128 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 67.87/34.39 [2019-03-28 12:37:25,129 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 67.87/34.39 [2019-03-28 12:37:25,129 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 67.87/34.39 [2019-03-28 12:37:25,129 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 67.87/34.39 [2019-03-28 12:37:25,129 INFO L518 LassoAnalysis]: Proved termination. 67.87/34.39 [2019-03-28 12:37:25,130 INFO L520 LassoAnalysis]: Termination argument consisting of: 67.87/34.39 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 67.87/34.39 Supporting invariants [] 67.87/34.39 [2019-03-28 12:37:25,152 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed 67.87/34.39 [2019-03-28 12:37:25,154 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.87/34.39 [2019-03-28 12:37:25,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.87/34.39 [2019-03-28 12:37:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.87/34.39 [2019-03-28 12:37:25,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core 67.87/34.39 [2019-03-28 12:37:25,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.87/34.39 [2019-03-28 12:37:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.87/34.39 [2019-03-28 12:37:25,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core 67.87/34.39 [2019-03-28 12:37:25,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.87/34.39 [2019-03-28 12:37:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.87/34.39 [2019-03-28 12:37:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:25,279 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 67.87/34.39 [2019-03-28 12:37:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.87/34.39 [2019-03-28 12:37:25,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core 67.87/34.39 [2019-03-28 12:37:25,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.87/34.39 [2019-03-28 12:37:25,306 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 16 67.87/34.39 [2019-03-28 12:37:25,307 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.87/34.39 [2019-03-28 12:37:25,311 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.87/34.39 [2019-03-28 12:37:25,312 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.87/34.39 [2019-03-28 12:37:25,312 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 67.87/34.39 [2019-03-28 12:37:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:25,362 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 67.87/34.39 [2019-03-28 12:37:25,362 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 5 predicates after loop cannibalization 67.87/34.39 [2019-03-28 12:37:25,362 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates 67.87/34.39 [2019-03-28 12:37:25,363 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 71 states and 91 transitions. cyclomatic complexity: 23 Second operand 6 states. 67.87/34.39 [2019-03-28 12:37:25,495 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 71 states and 91 transitions. cyclomatic complexity: 23. Second operand 6 states. Result 119 states and 149 transitions. Complement of second has 12 states. 67.87/34.39 [2019-03-28 12:37:25,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states 67.87/34.39 [2019-03-28 12:37:25,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 67.87/34.39 [2019-03-28 12:37:25,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. 67.87/34.39 [2019-03-28 12:37:25,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 53 transitions. Stem has 2 letters. Loop has 11 letters. 67.87/34.39 [2019-03-28 12:37:25,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.87/34.39 [2019-03-28 12:37:25,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 53 transitions. Stem has 13 letters. Loop has 11 letters. 67.87/34.39 [2019-03-28 12:37:25,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.87/34.39 [2019-03-28 12:37:25,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 53 transitions. Stem has 2 letters. Loop has 22 letters. 67.87/34.39 [2019-03-28 12:37:25,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.87/34.39 [2019-03-28 12:37:25,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 149 transitions. 67.87/34.39 [2019-03-28 12:37:25,505 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 67.87/34.39 [2019-03-28 12:37:25,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 104 states and 131 transitions. 67.87/34.39 [2019-03-28 12:37:25,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 67.87/34.39 [2019-03-28 12:37:25,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 67.87/34.39 [2019-03-28 12:37:25,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 131 transitions. 67.87/34.39 [2019-03-28 12:37:25,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 67.87/34.39 [2019-03-28 12:37:25,507 INFO L706 BuchiCegarLoop]: Abstraction has 104 states and 131 transitions. 67.87/34.39 [2019-03-28 12:37:25,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 131 transitions. 67.87/34.39 [2019-03-28 12:37:25,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. 67.87/34.39 [2019-03-28 12:37:25,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. 67.87/34.39 [2019-03-28 12:37:25,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. 67.87/34.39 [2019-03-28 12:37:25,512 INFO L729 BuchiCegarLoop]: Abstraction has 91 states and 116 transitions. 67.87/34.39 [2019-03-28 12:37:25,512 INFO L609 BuchiCegarLoop]: Abstraction has 91 states and 116 transitions. 67.87/34.39 [2019-03-28 12:37:25,512 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 67.87/34.39 [2019-03-28 12:37:25,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 116 transitions. 67.87/34.39 [2019-03-28 12:37:25,513 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 67.87/34.39 [2019-03-28 12:37:25,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 67.87/34.39 [2019-03-28 12:37:25,513 INFO L119 BuchiIsEmpty]: Starting construction of run 67.87/34.39 [2019-03-28 12:37:25,514 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 67.87/34.39 [2019-03-28 12:37:25,514 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 67.87/34.39 [2019-03-28 12:37:25,514 INFO L794 eck$LassoCheckResult]: Stem: 1054#ULTIMATE.startENTRY [120] 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] 1045#L-1 [185] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 1028#L17-2 67.87/34.39 [2019-03-28 12:37:25,515 INFO L796 eck$LassoCheckResult]: Loop: 1028#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 1094#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1095#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 1089#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1090#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1079#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 1080#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 1068#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 1066#L10 [99] L10-->L14: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet6_5|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_5|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 1062#L14 [108] L14-->L14-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~y~0.base_10)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8) |v_ULTIMATE.start_main_#t~mem9_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_16| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 1059#L14-1 [252] L14-1-->L17-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1)))) |v_#memory_int_20|) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_22)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_30| v_ULTIMATE.start_main_~y~0.base_22))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 1028#L17-2 67.87/34.39 [2019-03-28 12:37:25,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.87/34.39 [2019-03-28 12:37:25,515 INFO L82 PathProgramCache]: Analyzing trace with hash 4866, now seen corresponding path program 1 times 67.87/34.39 [2019-03-28 12:37:25,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.87/34.39 [2019-03-28 12:37:25,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.87/34.39 [2019-03-28 12:37:25,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:25,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:25,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:25,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.87/34.39 [2019-03-28 12:37:25,525 INFO L82 PathProgramCache]: Analyzing trace with hash 742354868, now seen corresponding path program 2 times 67.87/34.39 [2019-03-28 12:37:25,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.87/34.39 [2019-03-28 12:37:25,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.87/34.39 [2019-03-28 12:37:25,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:25,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:25,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:25,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.87/34.39 [2019-03-28 12:37:25,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1664557587, now seen corresponding path program 1 times 67.87/34.39 [2019-03-28 12:37:25,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.87/34.39 [2019-03-28 12:37:25,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.87/34.39 [2019-03-28 12:37:25,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:25,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:25,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:25,762 INFO L216 LassoAnalysis]: Preferences: 67.87/34.39 [2019-03-28 12:37:25,762 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 67.87/34.39 [2019-03-28 12:37:25,762 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 67.87/34.39 [2019-03-28 12:37:25,762 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 67.87/34.39 [2019-03-28 12:37:25,762 INFO L127 ssoRankerPreferences]: Use exernal solver: false 67.87/34.39 [2019-03-28 12:37:25,762 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 67.87/34.39 [2019-03-28 12:37:25,763 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 67.87/34.39 [2019-03-28 12:37:25,763 INFO L130 ssoRankerPreferences]: Path of dumped script: 67.87/34.39 [2019-03-28 12:37:25,763 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso 67.87/34.39 [2019-03-28 12:37:25,763 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 67.87/34.39 [2019-03-28 12:37:25,763 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 67.87/34.39 [2019-03-28 12:37:25,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:25,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:25,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:25,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:25,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:25,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:25,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:25,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:25,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:25,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:25,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:25,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:25,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:25,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:25,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:25,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:26,163 INFO L300 LassoAnalysis]: Preprocessing complete. 67.87/34.39 [2019-03-28 12:37:26,163 INFO L497 LassoAnalysis]: Using template 'affine'. 67.87/34.39 [2019-03-28 12:37:26,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:26,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:26,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:26,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:26,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:26,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:26,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:26,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:26,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:26,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:26,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:26,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:26,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:26,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:26,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:26,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:26,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:26,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:26,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:26,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:26,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:26,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:26,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:26,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:26,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:26,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:26,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:26,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:26,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:26,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:26,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:26,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:26,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:26,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:26,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:26,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:26,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:26,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:26,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:26,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:26,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:26,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:26,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:26,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:26,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:26,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:26,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:26,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:26,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:26,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:26,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:26,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:26,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:26,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:26,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:26,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:26,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:26,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:26,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:26,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:26,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:26,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:26,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:26,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:26,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:26,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:26,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:26,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:26,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:26,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:26,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:26,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:26,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:26,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:26,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:26,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:26,187 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:26,187 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:26,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:26,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:26,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:26,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:26,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:26,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:26,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:26,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:26,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:26,192 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 67.87/34.39 [2019-03-28 12:37:26,194 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 67.87/34.39 [2019-03-28 12:37:26,194 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 67.87/34.39 [2019-03-28 12:37:26,194 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 67.87/34.39 [2019-03-28 12:37:26,194 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 67.87/34.39 [2019-03-28 12:37:26,195 INFO L518 LassoAnalysis]: Proved termination. 67.87/34.39 [2019-03-28 12:37:26,195 INFO L520 LassoAnalysis]: Termination argument consisting of: 67.87/34.39 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_3 67.87/34.39 Supporting invariants [] 67.87/34.39 [2019-03-28 12:37:26,220 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed 67.87/34.39 [2019-03-28 12:37:26,221 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.87/34.39 [2019-03-28 12:37:26,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.87/34.39 [2019-03-28 12:37:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.87/34.39 [2019-03-28 12:37:26,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core 67.87/34.39 [2019-03-28 12:37:26,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.87/34.39 [2019-03-28 12:37:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.87/34.39 [2019-03-28 12:37:26,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core 67.87/34.39 [2019-03-28 12:37:26,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.87/34.39 [2019-03-28 12:37:26,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.87/34.39 [2019-03-28 12:37:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:26,371 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 67.87/34.39 [2019-03-28 12:37:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.87/34.39 [2019-03-28 12:37:26,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core 67.87/34.39 [2019-03-28 12:37:26,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.87/34.39 [2019-03-28 12:37:26,407 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 16 67.87/34.39 [2019-03-28 12:37:26,408 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.87/34.39 [2019-03-28 12:37:26,414 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.87/34.39 [2019-03-28 12:37:26,414 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.87/34.39 [2019-03-28 12:37:26,415 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 67.87/34.39 [2019-03-28 12:37:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:26,479 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 67.87/34.39 [2019-03-28 12:37:26,479 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 5 predicates after loop cannibalization 67.87/34.39 [2019-03-28 12:37:26,479 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates 67.87/34.39 [2019-03-28 12:37:26,479 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 91 states and 116 transitions. cyclomatic complexity: 29 Second operand 6 states. 67.87/34.39 [2019-03-28 12:37:26,629 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 91 states and 116 transitions. cyclomatic complexity: 29. Second operand 6 states. Result 139 states and 174 transitions. Complement of second has 12 states. 67.87/34.39 [2019-03-28 12:37:26,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states 67.87/34.39 [2019-03-28 12:37:26,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 67.87/34.39 [2019-03-28 12:37:26,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. 67.87/34.39 [2019-03-28 12:37:26,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 53 transitions. Stem has 2 letters. Loop has 11 letters. 67.87/34.39 [2019-03-28 12:37:26,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.87/34.39 [2019-03-28 12:37:26,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 53 transitions. Stem has 13 letters. Loop has 11 letters. 67.87/34.39 [2019-03-28 12:37:26,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.87/34.39 [2019-03-28 12:37:26,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 53 transitions. Stem has 2 letters. Loop has 22 letters. 67.87/34.39 [2019-03-28 12:37:26,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.87/34.39 [2019-03-28 12:37:26,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 174 transitions. 67.87/34.39 [2019-03-28 12:37:26,638 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 67.87/34.39 [2019-03-28 12:37:26,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 124 states and 156 transitions. 67.87/34.39 [2019-03-28 12:37:26,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 67.87/34.39 [2019-03-28 12:37:26,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 67.87/34.39 [2019-03-28 12:37:26,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 156 transitions. 67.87/34.39 [2019-03-28 12:37:26,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 67.87/34.39 [2019-03-28 12:37:26,641 INFO L706 BuchiCegarLoop]: Abstraction has 124 states and 156 transitions. 67.87/34.39 [2019-03-28 12:37:26,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 156 transitions. 67.87/34.39 [2019-03-28 12:37:26,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 91. 67.87/34.39 [2019-03-28 12:37:26,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. 67.87/34.39 [2019-03-28 12:37:26,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. 67.87/34.39 [2019-03-28 12:37:26,646 INFO L729 BuchiCegarLoop]: Abstraction has 91 states and 116 transitions. 67.87/34.39 [2019-03-28 12:37:26,646 INFO L609 BuchiCegarLoop]: Abstraction has 91 states and 116 transitions. 67.87/34.39 [2019-03-28 12:37:26,646 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 67.87/34.39 [2019-03-28 12:37:26,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 116 transitions. 67.87/34.39 [2019-03-28 12:37:26,647 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 67.87/34.39 [2019-03-28 12:37:26,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 67.87/34.39 [2019-03-28 12:37:26,647 INFO L119 BuchiIsEmpty]: Starting construction of run 67.87/34.39 [2019-03-28 12:37:26,648 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 67.87/34.39 [2019-03-28 12:37:26,648 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 67.87/34.39 [2019-03-28 12:37:26,649 INFO L794 eck$LassoCheckResult]: Stem: 1434#ULTIMATE.startENTRY [120] 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] 1425#L-1 [184] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 1426#L17-2 67.87/34.39 [2019-03-28 12:37:26,649 INFO L796 eck$LassoCheckResult]: Loop: 1426#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 1466#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1467#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 1487#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1486#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1485#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 1484#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 1444#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 1443#L10 [99] L10-->L14: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet6_5|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_5|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 1440#L14 [108] L14-->L14-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~y~0.base_10)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8) |v_ULTIMATE.start_main_#t~mem9_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_16| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 1437#L14-1 [252] L14-1-->L17-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1)))) |v_#memory_int_20|) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_22)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_30| v_ULTIMATE.start_main_~y~0.base_22))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 1426#L17-2 67.87/34.39 [2019-03-28 12:37:26,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.87/34.39 [2019-03-28 12:37:26,650 INFO L82 PathProgramCache]: Analyzing trace with hash 4865, now seen corresponding path program 1 times 67.87/34.39 [2019-03-28 12:37:26,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.87/34.39 [2019-03-28 12:37:26,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.87/34.39 [2019-03-28 12:37:26,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:26,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:26,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:26,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.87/34.39 [2019-03-28 12:37:26,661 INFO L82 PathProgramCache]: Analyzing trace with hash 742354868, now seen corresponding path program 3 times 67.87/34.39 [2019-03-28 12:37:26,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.87/34.39 [2019-03-28 12:37:26,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.87/34.39 [2019-03-28 12:37:26,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:26,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:26,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:26,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.87/34.39 [2019-03-28 12:37:26,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1535474868, now seen corresponding path program 1 times 67.87/34.39 [2019-03-28 12:37:26,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.87/34.39 [2019-03-28 12:37:26,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.87/34.39 [2019-03-28 12:37:26,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:26,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:26,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.87/34.39 [2019-03-28 12:37:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.87/34.39 [2019-03-28 12:37:26,798 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 67.87/34.39 [2019-03-28 12:37:26,896 INFO L216 LassoAnalysis]: Preferences: 67.87/34.39 [2019-03-28 12:37:26,897 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 67.87/34.39 [2019-03-28 12:37:26,897 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 67.87/34.39 [2019-03-28 12:37:26,897 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 67.87/34.39 [2019-03-28 12:37:26,897 INFO L127 ssoRankerPreferences]: Use exernal solver: false 67.87/34.39 [2019-03-28 12:37:26,897 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 67.87/34.39 [2019-03-28 12:37:26,897 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 67.87/34.39 [2019-03-28 12:37:26,897 INFO L130 ssoRankerPreferences]: Path of dumped script: 67.87/34.39 [2019-03-28 12:37:26,897 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Lasso 67.87/34.39 [2019-03-28 12:37:26,898 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 67.87/34.39 [2019-03-28 12:37:26,898 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 67.87/34.39 [2019-03-28 12:37:26,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:26,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:26,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:26,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:26,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:26,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:26,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:26,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:26,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:26,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:26,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:26,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:26,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:26,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:27,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:27,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.87/34.39 [2019-03-28 12:37:27,318 INFO L300 LassoAnalysis]: Preprocessing complete. 67.87/34.39 [2019-03-28 12:37:27,319 INFO L497 LassoAnalysis]: Using template 'affine'. 67.87/34.39 [2019-03-28 12:37:27,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:27,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:27,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:27,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:27,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:27,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:27,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:27,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:27,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:27,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:27,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:27,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:27,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:27,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:27,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:27,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:27,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:27,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:27,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:27,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:27,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:27,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:27,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:27,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:27,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:27,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:27,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:27,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:27,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:27,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:27,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:27,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:27,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:27,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:27,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:27,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:27,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:27,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:27,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:27,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:27,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:27,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:27,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:27,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:27,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:27,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:27,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:27,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:27,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:27,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:27,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:27,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:27,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:27,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:27,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:27,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:27,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:27,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:27,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:27,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:27,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:27,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:27,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:27,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:27,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:27,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:27,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:27,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:27,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:27,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:27,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:27,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:27,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:27,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:27,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:27,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:27,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:27,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:27,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:27,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:27,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:27,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:27,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:27,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:27,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:27,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:27,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:27,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:27,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:27,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:27,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:27,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:27,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:27,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:27,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:27,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:27,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:27,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:27,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:27,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:27,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:27,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:27,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:27,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:27,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:27,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:27,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:27,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:27,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:27,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:27,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:27,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:27,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:27,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:27,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:27,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:27,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:27,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:27,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:27,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:27,353 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:27,353 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:27,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:27,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:27,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:27,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.87/34.39 [2019-03-28 12:37:27,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:27,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:27,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:27,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.87/34.39 [2019-03-28 12:37:27,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.87/34.39 [2019-03-28 12:37:27,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.87/34.39 [2019-03-28 12:37:27,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.87/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.87/34.39 Number of strict supporting invariants: 0 67.87/34.39 Number of non-strict supporting invariants: 1 67.87/34.39 Consider only non-deceasing supporting invariants: true 67.87/34.39 Simplify termination arguments: true 67.87/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.87/34.39 [2019-03-28 12:37:27,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.87/34.39 [2019-03-28 12:37:27,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.87/34.39 [2019-03-28 12:37:27,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.87/34.39 [2019-03-28 12:37:27,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.87/34.39 [2019-03-28 12:37:27,374 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.39 [2019-03-28 12:37:27,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.39 [2019-03-28 12:37:27,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.39 [2019-03-28 12:37:27,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.39 Number of strict supporting invariants: 0 67.97/34.39 Number of non-strict supporting invariants: 1 67.97/34.39 Consider only non-deceasing supporting invariants: true 67.97/34.39 Simplify termination arguments: true 67.97/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.39 [2019-03-28 12:37:27,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.39 [2019-03-28 12:37:27,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.39 [2019-03-28 12:37:27,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.39 [2019-03-28 12:37:27,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.39 [2019-03-28 12:37:27,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.39 [2019-03-28 12:37:27,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.39 [2019-03-28 12:37:27,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.39 [2019-03-28 12:37:27,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.39 Number of strict supporting invariants: 0 67.97/34.39 Number of non-strict supporting invariants: 1 67.97/34.39 Consider only non-deceasing supporting invariants: true 67.97/34.39 Simplify termination arguments: true 67.97/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.39 [2019-03-28 12:37:27,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.39 [2019-03-28 12:37:27,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.39 [2019-03-28 12:37:27,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.39 [2019-03-28 12:37:27,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.39 [2019-03-28 12:37:27,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.39 [2019-03-28 12:37:27,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.39 [2019-03-28 12:37:27,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.39 [2019-03-28 12:37:27,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.39 Number of strict supporting invariants: 0 67.97/34.39 Number of non-strict supporting invariants: 1 67.97/34.39 Consider only non-deceasing supporting invariants: true 67.97/34.39 Simplify termination arguments: true 67.97/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.39 [2019-03-28 12:37:27,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.39 [2019-03-28 12:37:27,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.39 [2019-03-28 12:37:27,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.39 [2019-03-28 12:37:27,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.39 [2019-03-28 12:37:27,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.39 [2019-03-28 12:37:27,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.39 [2019-03-28 12:37:27,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.39 [2019-03-28 12:37:27,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.39 Number of strict supporting invariants: 0 67.97/34.39 Number of non-strict supporting invariants: 1 67.97/34.39 Consider only non-deceasing supporting invariants: true 67.97/34.39 Simplify termination arguments: true 67.97/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.39 [2019-03-28 12:37:27,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.39 [2019-03-28 12:37:27,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.39 [2019-03-28 12:37:27,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.39 [2019-03-28 12:37:27,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.39 [2019-03-28 12:37:27,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.39 [2019-03-28 12:37:27,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.39 [2019-03-28 12:37:27,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.39 [2019-03-28 12:37:27,403 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 67.97/34.39 [2019-03-28 12:37:27,405 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 67.97/34.39 [2019-03-28 12:37:27,405 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 67.97/34.39 [2019-03-28 12:37:27,405 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 67.97/34.39 [2019-03-28 12:37:27,405 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 67.97/34.39 [2019-03-28 12:37:27,406 INFO L518 LassoAnalysis]: Proved termination. 67.97/34.39 [2019-03-28 12:37:27,406 INFO L520 LassoAnalysis]: Termination argument consisting of: 67.97/34.39 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4 67.97/34.39 Supporting invariants [] 67.97/34.39 [2019-03-28 12:37:27,429 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed 67.97/34.39 [2019-03-28 12:37:27,430 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.97/34.39 [2019-03-28 12:37:27,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.39 [2019-03-28 12:37:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.39 [2019-03-28 12:37:27,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core 67.97/34.39 [2019-03-28 12:37:27,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.39 [2019-03-28 12:37:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.39 [2019-03-28 12:37:27,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core 67.97/34.39 [2019-03-28 12:37:27,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.39 [2019-03-28 12:37:27,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.97/34.39 [2019-03-28 12:37:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.39 [2019-03-28 12:37:27,585 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 67.97/34.39 [2019-03-28 12:37:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.39 [2019-03-28 12:37:27,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core 67.97/34.39 [2019-03-28 12:37:27,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.39 [2019-03-28 12:37:27,613 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 16 67.97/34.39 [2019-03-28 12:37:27,614 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.39 [2019-03-28 12:37:27,619 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.39 [2019-03-28 12:37:27,620 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.39 [2019-03-28 12:37:27,620 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 67.97/34.39 [2019-03-28 12:37:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.39 [2019-03-28 12:37:27,674 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 67.97/34.39 [2019-03-28 12:37:27,674 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 5 predicates after loop cannibalization 67.97/34.39 [2019-03-28 12:37:27,675 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates 67.97/34.39 [2019-03-28 12:37:27,675 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 91 states and 116 transitions. cyclomatic complexity: 29 Second operand 6 states. 67.97/34.39 [2019-03-28 12:37:27,787 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 91 states and 116 transitions. cyclomatic complexity: 29. Second operand 6 states. Result 139 states and 174 transitions. Complement of second has 12 states. 67.97/34.39 [2019-03-28 12:37:27,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states 67.97/34.39 [2019-03-28 12:37:27,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 67.97/34.39 [2019-03-28 12:37:27,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. 67.97/34.39 [2019-03-28 12:37:27,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 53 transitions. Stem has 2 letters. Loop has 11 letters. 67.97/34.39 [2019-03-28 12:37:27,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.97/34.39 [2019-03-28 12:37:27,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 53 transitions. Stem has 13 letters. Loop has 11 letters. 67.97/34.39 [2019-03-28 12:37:27,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.97/34.39 [2019-03-28 12:37:27,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 53 transitions. Stem has 2 letters. Loop has 22 letters. 67.97/34.39 [2019-03-28 12:37:27,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.97/34.39 [2019-03-28 12:37:27,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 174 transitions. 67.97/34.39 [2019-03-28 12:37:27,795 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 67.97/34.39 [2019-03-28 12:37:27,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 124 states and 156 transitions. 67.97/34.39 [2019-03-28 12:37:27,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 67.97/34.39 [2019-03-28 12:37:27,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 67.97/34.39 [2019-03-28 12:37:27,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 156 transitions. 67.97/34.39 [2019-03-28 12:37:27,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 67.97/34.39 [2019-03-28 12:37:27,797 INFO L706 BuchiCegarLoop]: Abstraction has 124 states and 156 transitions. 67.97/34.39 [2019-03-28 12:37:27,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 156 transitions. 67.97/34.39 [2019-03-28 12:37:27,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 91. 67.97/34.39 [2019-03-28 12:37:27,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. 67.97/34.39 [2019-03-28 12:37:27,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. 67.97/34.39 [2019-03-28 12:37:27,801 INFO L729 BuchiCegarLoop]: Abstraction has 91 states and 116 transitions. 67.97/34.39 [2019-03-28 12:37:27,801 INFO L609 BuchiCegarLoop]: Abstraction has 91 states and 116 transitions. 67.97/34.39 [2019-03-28 12:37:27,801 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 67.97/34.39 [2019-03-28 12:37:27,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 116 transitions. 67.97/34.39 [2019-03-28 12:37:27,802 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 67.97/34.39 [2019-03-28 12:37:27,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 67.97/34.39 [2019-03-28 12:37:27,802 INFO L119 BuchiIsEmpty]: Starting construction of run 67.97/34.39 [2019-03-28 12:37:27,803 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 67.97/34.39 [2019-03-28 12:37:27,803 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 67.97/34.39 [2019-03-28 12:37:27,803 INFO L794 eck$LassoCheckResult]: Stem: 1819#ULTIMATE.startENTRY [120] 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] 1811#L-1 [186] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 1812#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 1847#L8-1 [192] L8-1-->L8-2: Formula: (and (< |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1790#L8-2 67.97/34.39 [2019-03-28 12:37:27,804 INFO L796 eck$LassoCheckResult]: Loop: 1790#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 1786#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1787#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1820#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 1809#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 1803#L9-1 [161] L9-1-->L17: Formula: (>= 0 |v_ULTIMATE.start_main_#t~mem5_6|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 1804#L17 [208] L17-->L18: Formula: (> |v_ULTIMATE.start_main_#t~nondet10_3| 0) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_3|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10] 1801#L18 [93] L18-->L18-1: Formula: (and (= (select |v_#valid_22| v_ULTIMATE.start_main_~x~0.base_16) 1) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_20| v_ULTIMATE.start_main_~x~0.base_16)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12) |v_ULTIMATE.start_main_#t~mem11_2|)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 1796#L18-1 [255] L18-1-->L17-2: Formula: (and (= |v_#memory_int_26| (store |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26) v_ULTIMATE.start_main_~x~0.offset_19 (+ |v_ULTIMATE.start_main_#t~mem11_6| 1)))) (= 1 (select |v_#valid_44| v_ULTIMATE.start_main_~x~0.base_26)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_19) (<= (+ v_ULTIMATE.start_main_~x~0.offset_19 4) (select |v_#length_33| v_ULTIMATE.start_main_~x~0.base_26))) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, #memory_int] 1797#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 1858#L8-1 [192] L8-1-->L8-2: Formula: (and (< |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1790#L8-2 67.97/34.39 [2019-03-28 12:37:27,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.39 [2019-03-28 12:37:27,804 INFO L82 PathProgramCache]: Analyzing trace with hash 4681905, now seen corresponding path program 1 times 67.97/34.39 [2019-03-28 12:37:27,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.97/34.39 [2019-03-28 12:37:27,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.97/34.39 [2019-03-28 12:37:27,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.39 [2019-03-28 12:37:27,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.97/34.39 [2019-03-28 12:37:27,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.39 [2019-03-28 12:37:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.39 [2019-03-28 12:37:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.39 [2019-03-28 12:37:27,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.39 [2019-03-28 12:37:27,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1490135663, now seen corresponding path program 2 times 67.97/34.39 [2019-03-28 12:37:27,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.97/34.39 [2019-03-28 12:37:27,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.97/34.39 [2019-03-28 12:37:27,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.39 [2019-03-28 12:37:27,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.97/34.39 [2019-03-28 12:37:27,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.39 [2019-03-28 12:37:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.39 [2019-03-28 12:37:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.39 [2019-03-28 12:37:27,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.39 [2019-03-28 12:37:27,826 INFO L82 PathProgramCache]: Analyzing trace with hash -2029873439, now seen corresponding path program 1 times 67.97/34.39 [2019-03-28 12:37:27,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.97/34.39 [2019-03-28 12:37:27,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.97/34.39 [2019-03-28 12:37:27,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.39 [2019-03-28 12:37:27,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 67.97/34.39 [2019-03-28 12:37:27,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.39 [2019-03-28 12:37:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.39 [2019-03-28 12:37:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.39 [2019-03-28 12:37:28,093 INFO L216 LassoAnalysis]: Preferences: 67.97/34.39 [2019-03-28 12:37:28,093 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 67.97/34.39 [2019-03-28 12:37:28,093 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 67.97/34.39 [2019-03-28 12:37:28,093 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 67.97/34.39 [2019-03-28 12:37:28,094 INFO L127 ssoRankerPreferences]: Use exernal solver: false 67.97/34.39 [2019-03-28 12:37:28,094 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 67.97/34.39 [2019-03-28 12:37:28,094 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 67.97/34.39 [2019-03-28 12:37:28,094 INFO L130 ssoRankerPreferences]: Path of dumped script: 67.97/34.39 [2019-03-28 12:37:28,094 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Lasso 67.97/34.39 [2019-03-28 12:37:28,094 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 67.97/34.39 [2019-03-28 12:37:28,094 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 67.97/34.39 [2019-03-28 12:37:28,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:28,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:28,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:28,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:28,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:28,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:28,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:28,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:28,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:28,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:28,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:28,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:28,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:28,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:28,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:28,533 INFO L300 LassoAnalysis]: Preprocessing complete. 67.97/34.39 [2019-03-28 12:37:28,533 INFO L497 LassoAnalysis]: Using template 'affine'. 67.97/34.39 [2019-03-28 12:37:28,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.39 Number of strict supporting invariants: 0 67.97/34.39 Number of non-strict supporting invariants: 1 67.97/34.39 Consider only non-deceasing supporting invariants: true 67.97/34.39 Simplify termination arguments: true 67.97/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.39 [2019-03-28 12:37:28,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.39 [2019-03-28 12:37:28,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.39 [2019-03-28 12:37:28,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.39 [2019-03-28 12:37:28,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.39 [2019-03-28 12:37:28,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.39 [2019-03-28 12:37:28,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.39 [2019-03-28 12:37:28,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.39 [2019-03-28 12:37:28,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.39 Number of strict supporting invariants: 0 67.97/34.39 Number of non-strict supporting invariants: 1 67.97/34.39 Consider only non-deceasing supporting invariants: true 67.97/34.39 Simplify termination arguments: true 67.97/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.39 [2019-03-28 12:37:28,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.39 [2019-03-28 12:37:28,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.39 [2019-03-28 12:37:28,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.39 [2019-03-28 12:37:28,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.39 [2019-03-28 12:37:28,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.39 [2019-03-28 12:37:28,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.39 [2019-03-28 12:37:28,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.39 [2019-03-28 12:37:28,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.39 Number of strict supporting invariants: 0 67.97/34.39 Number of non-strict supporting invariants: 1 67.97/34.39 Consider only non-deceasing supporting invariants: true 67.97/34.39 Simplify termination arguments: true 67.97/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.39 [2019-03-28 12:37:28,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.39 [2019-03-28 12:37:28,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.39 [2019-03-28 12:37:28,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.39 [2019-03-28 12:37:28,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.39 [2019-03-28 12:37:28,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.39 [2019-03-28 12:37:28,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.39 [2019-03-28 12:37:28,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.39 [2019-03-28 12:37:28,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.39 [2019-03-28 12:37:28,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.39 Number of strict supporting invariants: 0 67.97/34.39 Number of non-strict supporting invariants: 1 67.97/34.39 Consider only non-deceasing supporting invariants: true 67.97/34.39 Simplify termination arguments: true 67.97/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.39 [2019-03-28 12:37:28,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.39 [2019-03-28 12:37:28,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.39 [2019-03-28 12:37:28,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.39 [2019-03-28 12:37:28,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.39 [2019-03-28 12:37:28,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.39 [2019-03-28 12:37:28,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.39 [2019-03-28 12:37:28,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.39 [2019-03-28 12:37:28,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.39 [2019-03-28 12:37:28,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.39 Number of strict supporting invariants: 0 67.97/34.39 Number of non-strict supporting invariants: 1 67.97/34.39 Consider only non-deceasing supporting invariants: true 67.97/34.39 Simplify termination arguments: true 67.97/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.39 [2019-03-28 12:37:28,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.39 [2019-03-28 12:37:28,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.39 [2019-03-28 12:37:28,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.39 [2019-03-28 12:37:28,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.39 [2019-03-28 12:37:28,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.39 [2019-03-28 12:37:28,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.39 [2019-03-28 12:37:28,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.39 [2019-03-28 12:37:28,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.39 [2019-03-28 12:37:28,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.39 Number of strict supporting invariants: 0 67.97/34.39 Number of non-strict supporting invariants: 1 67.97/34.39 Consider only non-deceasing supporting invariants: true 67.97/34.39 Simplify termination arguments: true 67.97/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.39 [2019-03-28 12:37:28,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.39 [2019-03-28 12:37:28,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.39 [2019-03-28 12:37:28,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.39 [2019-03-28 12:37:28,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.39 [2019-03-28 12:37:28,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.39 [2019-03-28 12:37:28,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.39 [2019-03-28 12:37:28,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.39 [2019-03-28 12:37:28,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.39 [2019-03-28 12:37:28,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.39 Number of strict supporting invariants: 0 67.97/34.39 Number of non-strict supporting invariants: 1 67.97/34.39 Consider only non-deceasing supporting invariants: true 67.97/34.39 Simplify termination arguments: true 67.97/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.39 [2019-03-28 12:37:28,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.39 [2019-03-28 12:37:28,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.39 [2019-03-28 12:37:28,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.39 [2019-03-28 12:37:28,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.39 [2019-03-28 12:37:28,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.39 [2019-03-28 12:37:28,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.39 [2019-03-28 12:37:28,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.39 [2019-03-28 12:37:28,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.39 [2019-03-28 12:37:28,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.39 Number of strict supporting invariants: 0 67.97/34.39 Number of non-strict supporting invariants: 1 67.97/34.39 Consider only non-deceasing supporting invariants: true 67.97/34.39 Simplify termination arguments: true 67.97/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.39 [2019-03-28 12:37:28,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.39 [2019-03-28 12:37:28,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.39 [2019-03-28 12:37:28,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.39 [2019-03-28 12:37:28,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.39 [2019-03-28 12:37:28,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.39 [2019-03-28 12:37:28,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.39 [2019-03-28 12:37:28,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.39 [2019-03-28 12:37:28,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.39 [2019-03-28 12:37:28,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.39 Number of strict supporting invariants: 0 67.97/34.39 Number of non-strict supporting invariants: 1 67.97/34.39 Consider only non-deceasing supporting invariants: true 67.97/34.39 Simplify termination arguments: true 67.97/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.39 [2019-03-28 12:37:28,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.39 [2019-03-28 12:37:28,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.39 [2019-03-28 12:37:28,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.39 [2019-03-28 12:37:28,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.39 [2019-03-28 12:37:28,557 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.39 [2019-03-28 12:37:28,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.39 [2019-03-28 12:37:28,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.39 [2019-03-28 12:37:28,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.39 Number of strict supporting invariants: 0 67.97/34.39 Number of non-strict supporting invariants: 1 67.97/34.39 Consider only non-deceasing supporting invariants: true 67.97/34.39 Simplify termination arguments: true 67.97/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.39 [2019-03-28 12:37:28,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.39 [2019-03-28 12:37:28,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.39 [2019-03-28 12:37:28,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.39 [2019-03-28 12:37:28,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.39 [2019-03-28 12:37:28,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.39 [2019-03-28 12:37:28,563 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.39 [2019-03-28 12:37:28,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.39 [2019-03-28 12:37:28,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.39 Number of strict supporting invariants: 0 67.97/34.39 Number of non-strict supporting invariants: 1 67.97/34.39 Consider only non-deceasing supporting invariants: true 67.97/34.39 Simplify termination arguments: true 67.97/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.39 [2019-03-28 12:37:28,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.39 [2019-03-28 12:37:28,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.39 [2019-03-28 12:37:28,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.39 [2019-03-28 12:37:28,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.39 [2019-03-28 12:37:28,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.39 [2019-03-28 12:37:28,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.39 [2019-03-28 12:37:28,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.39 [2019-03-28 12:37:28,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.39 [2019-03-28 12:37:28,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.39 Number of strict supporting invariants: 0 67.97/34.39 Number of non-strict supporting invariants: 1 67.97/34.39 Consider only non-deceasing supporting invariants: true 67.97/34.39 Simplify termination arguments: true 67.97/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.39 [2019-03-28 12:37:28,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.39 [2019-03-28 12:37:28,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.39 [2019-03-28 12:37:28,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.39 [2019-03-28 12:37:28,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.39 [2019-03-28 12:37:28,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.39 [2019-03-28 12:37:28,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.39 [2019-03-28 12:37:28,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.39 [2019-03-28 12:37:28,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.39 Number of strict supporting invariants: 0 67.97/34.39 Number of non-strict supporting invariants: 1 67.97/34.39 Consider only non-deceasing supporting invariants: true 67.97/34.39 Simplify termination arguments: true 67.97/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.39 [2019-03-28 12:37:28,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.39 [2019-03-28 12:37:28,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.39 [2019-03-28 12:37:28,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.39 [2019-03-28 12:37:28,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.39 [2019-03-28 12:37:28,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.39 [2019-03-28 12:37:28,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.39 [2019-03-28 12:37:28,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.39 [2019-03-28 12:37:28,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.39 Number of strict supporting invariants: 0 67.97/34.39 Number of non-strict supporting invariants: 1 67.97/34.39 Consider only non-deceasing supporting invariants: true 67.97/34.39 Simplify termination arguments: true 67.97/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.39 [2019-03-28 12:37:28,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.39 [2019-03-28 12:37:28,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.39 [2019-03-28 12:37:28,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.39 [2019-03-28 12:37:28,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.39 [2019-03-28 12:37:28,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.39 [2019-03-28 12:37:28,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.39 [2019-03-28 12:37:28,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.39 [2019-03-28 12:37:28,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.39 Number of strict supporting invariants: 0 67.97/34.39 Number of non-strict supporting invariants: 1 67.97/34.39 Consider only non-deceasing supporting invariants: true 67.97/34.39 Simplify termination arguments: true 67.97/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.39 [2019-03-28 12:37:28,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.39 [2019-03-28 12:37:28,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.39 [2019-03-28 12:37:28,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.39 [2019-03-28 12:37:28,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.39 [2019-03-28 12:37:28,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.39 [2019-03-28 12:37:28,601 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.39 [2019-03-28 12:37:28,613 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 67.97/34.39 [2019-03-28 12:37:28,617 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 67.97/34.39 [2019-03-28 12:37:28,617 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. 67.97/34.39 [2019-03-28 12:37:28,618 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 67.97/34.39 [2019-03-28 12:37:28,619 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 67.97/34.39 [2019-03-28 12:37:28,620 INFO L518 LassoAnalysis]: Proved termination. 67.97/34.39 [2019-03-28 12:37:28,620 INFO L520 LassoAnalysis]: Termination argument consisting of: 67.97/34.39 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_5) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_5 67.97/34.39 Supporting invariants [] 67.97/34.39 [2019-03-28 12:37:28,655 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed 67.97/34.39 [2019-03-28 12:37:28,656 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.97/34.39 [2019-03-28 12:37:28,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.39 [2019-03-28 12:37:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.39 [2019-03-28 12:37:28,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core 67.97/34.39 [2019-03-28 12:37:28,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.39 [2019-03-28 12:37:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.39 [2019-03-28 12:37:28,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core 67.97/34.39 [2019-03-28 12:37:28,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.39 [2019-03-28 12:37:28,721 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 30 treesize of output 18 67.97/34.39 [2019-03-28 12:37:28,722 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.39 [2019-03-28 12:37:28,729 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.39 [2019-03-28 12:37:28,729 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.39 [2019-03-28 12:37:28,730 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:9 67.97/34.39 [2019-03-28 12:37:28,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.97/34.39 [2019-03-28 12:37:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.39 [2019-03-28 12:37:28,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core 67.97/34.39 [2019-03-28 12:37:28,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.39 [2019-03-28 12:37:28,798 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 30 treesize of output 18 67.97/34.39 [2019-03-28 12:37:28,799 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.39 [2019-03-28 12:37:28,804 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.39 [2019-03-28 12:37:28,805 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.39 [2019-03-28 12:37:28,805 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:9 67.97/34.39 [2019-03-28 12:37:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.39 [2019-03-28 12:37:28,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core 67.97/34.39 [2019-03-28 12:37:28,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.39 [2019-03-28 12:37:28,854 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 30 treesize of output 18 67.97/34.39 [2019-03-28 12:37:28,856 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.39 [2019-03-28 12:37:28,861 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.39 [2019-03-28 12:37:28,862 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.39 [2019-03-28 12:37:28,862 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:9 67.97/34.39 [2019-03-28 12:37:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.39 [2019-03-28 12:37:28,885 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 67.97/34.39 [2019-03-28 12:37:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.39 [2019-03-28 12:37:28,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core 67.97/34.39 [2019-03-28 12:37:28,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.39 [2019-03-28 12:37:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.39 [2019-03-28 12:37:29,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core 67.97/34.39 [2019-03-28 12:37:29,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.39 [2019-03-28 12:37:29,113 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 37 treesize of output 21 67.97/34.39 [2019-03-28 12:37:29,113 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.39 [2019-03-28 12:37:29,122 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.39 [2019-03-28 12:37:29,123 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.39 [2019-03-28 12:37:29,123 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:13 67.97/34.39 [2019-03-28 12:37:29,197 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 8 predicates after loop cannibalization 67.97/34.39 [2019-03-28 12:37:29,198 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates 67.97/34.39 [2019-03-28 12:37:29,198 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 91 states and 116 transitions. cyclomatic complexity: 29 Second operand 6 states. 67.97/34.39 [2019-03-28 12:37:29,760 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 91 states and 116 transitions. cyclomatic complexity: 29. Second operand 6 states. Result 537 states and 653 transitions. Complement of second has 132 states. 67.97/34.39 [2019-03-28 12:37:29,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 1 stem states 18 non-accepting loop states 1 accepting loop states 67.97/34.39 [2019-03-28 12:37:29,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 67.97/34.39 [2019-03-28 12:37:29,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 110 transitions. 67.97/34.39 [2019-03-28 12:37:29,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 110 transitions. Stem has 4 letters. Loop has 11 letters. 67.97/34.39 [2019-03-28 12:37:29,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.97/34.39 [2019-03-28 12:37:29,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 110 transitions. Stem has 15 letters. Loop has 11 letters. 67.97/34.39 [2019-03-28 12:37:29,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.97/34.39 [2019-03-28 12:37:29,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 110 transitions. Stem has 4 letters. Loop has 22 letters. 67.97/34.39 [2019-03-28 12:37:29,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.97/34.39 [2019-03-28 12:37:29,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 537 states and 653 transitions. 67.97/34.39 [2019-03-28 12:37:29,788 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 150 67.97/34.39 [2019-03-28 12:37:29,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 537 states to 275 states and 335 transitions. 67.97/34.39 [2019-03-28 12:37:29,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 67.97/34.39 [2019-03-28 12:37:29,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 67.97/34.39 [2019-03-28 12:37:29,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 275 states and 335 transitions. 67.97/34.39 [2019-03-28 12:37:29,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 67.97/34.39 [2019-03-28 12:37:29,791 INFO L706 BuchiCegarLoop]: Abstraction has 275 states and 335 transitions. 67.97/34.39 [2019-03-28 12:37:29,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states and 335 transitions. 67.97/34.39 [2019-03-28 12:37:29,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 129. 67.97/34.39 [2019-03-28 12:37:29,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. 67.97/34.39 [2019-03-28 12:37:29,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 166 transitions. 67.97/34.39 [2019-03-28 12:37:29,796 INFO L729 BuchiCegarLoop]: Abstraction has 129 states and 166 transitions. 67.97/34.39 [2019-03-28 12:37:29,796 INFO L609 BuchiCegarLoop]: Abstraction has 129 states and 166 transitions. 67.97/34.39 [2019-03-28 12:37:29,796 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 67.97/34.39 [2019-03-28 12:37:29,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 166 transitions. 67.97/34.39 [2019-03-28 12:37:29,797 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 67.97/34.39 [2019-03-28 12:37:29,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 67.97/34.39 [2019-03-28 12:37:29,798 INFO L119 BuchiIsEmpty]: Starting construction of run 67.97/34.39 [2019-03-28 12:37:29,798 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 67.97/34.39 [2019-03-28 12:37:29,798 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 67.97/34.39 [2019-03-28 12:37:29,799 INFO L794 eck$LassoCheckResult]: Stem: 2845#ULTIMATE.startENTRY [120] 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] 2836#L-1 [186] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 2837#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 2859#L8-1 [192] L8-1-->L8-2: Formula: (and (< |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 2870#L8-2 67.97/34.39 [2019-03-28 12:37:29,799 INFO L796 eck$LassoCheckResult]: Loop: 2870#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 2813#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 2814#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 2846#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 2834#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 2830#L9-1 [161] L9-1-->L17: Formula: (>= 0 |v_ULTIMATE.start_main_#t~mem5_6|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 2822#L17 [150] L17-->L20: Formula: (= |v_ULTIMATE.start_main_#t~nondet10_5| 0) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10] 2823#L20 [138] L20-->L20-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_12 4) (select |v_#length_24| v_ULTIMATE.start_main_~y~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem12_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~y~0.base_16) v_ULTIMATE.start_main_~y~0.offset_12)) (= (select |v_#valid_26| v_ULTIMATE.start_main_~y~0.base_16) 1) (<= 0 v_ULTIMATE.start_main_~y~0.offset_12)) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_16, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_12, #length=|v_#length_24|, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_16, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_12, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 2832#L20-1 [254] L20-1-->L21: Formula: (and (= 1 (select |v_#valid_43| v_ULTIMATE.start_main_~y~0.base_23)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_17) (= |v_#memory_int_24| (store |v_#memory_int_25| v_ULTIMATE.start_main_~y~0.base_23 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~y~0.base_23) v_ULTIMATE.start_main_~y~0.offset_17 (+ |v_ULTIMATE.start_main_#t~mem12_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~y~0.offset_17 4) (select |v_#length_32| v_ULTIMATE.start_main_~y~0.base_23))) InVars {ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_23, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_17, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_23, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_17, #length=|v_#length_32|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12, #memory_int] 2833#L21 [257] L21-->L17-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_20 4) (select |v_#length_35| v_ULTIMATE.start_main_~x~0.base_27)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_20) (= (select |v_#valid_46| v_ULTIMATE.start_main_~x~0.base_27) 1) (= (store |v_#memory_int_31| v_ULTIMATE.start_main_~x~0.base_27 (store (select |v_#memory_int_31| v_ULTIMATE.start_main_~x~0.base_27) v_ULTIMATE.start_main_~x~0.offset_20 |v_ULTIMATE.start_main_#t~nondet13_5|)) |v_#memory_int_30|)) InVars {ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_35|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_27} OutVars{ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_30|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_35|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_27} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13, #memory_int] 2809#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 2810#L8-1 [192] L8-1-->L8-2: Formula: (and (< |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 2870#L8-2 67.97/34.39 [2019-03-28 12:37:29,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.39 [2019-03-28 12:37:29,800 INFO L82 PathProgramCache]: Analyzing trace with hash 4681905, now seen corresponding path program 2 times 67.97/34.39 [2019-03-28 12:37:29,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.97/34.39 [2019-03-28 12:37:29,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.97/34.39 [2019-03-28 12:37:29,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.39 [2019-03-28 12:37:29,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.97/34.39 [2019-03-28 12:37:29,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.39 [2019-03-28 12:37:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.39 [2019-03-28 12:37:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.39 [2019-03-28 12:37:29,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.39 [2019-03-28 12:37:29,810 INFO L82 PathProgramCache]: Analyzing trace with hash -568421964, now seen corresponding path program 1 times 67.97/34.39 [2019-03-28 12:37:29,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.97/34.39 [2019-03-28 12:37:29,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.97/34.39 [2019-03-28 12:37:29,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.39 [2019-03-28 12:37:29,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 67.97/34.39 [2019-03-28 12:37:29,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.39 [2019-03-28 12:37:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.39 [2019-03-28 12:37:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.39 [2019-03-28 12:37:29,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.39 [2019-03-28 12:37:29,821 INFO L82 PathProgramCache]: Analyzing trace with hash -120423836, now seen corresponding path program 1 times 67.97/34.39 [2019-03-28 12:37:29,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.97/34.39 [2019-03-28 12:37:29,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.97/34.39 [2019-03-28 12:37:29,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.39 [2019-03-28 12:37:29,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.97/34.39 [2019-03-28 12:37:29,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.39 [2019-03-28 12:37:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.39 [2019-03-28 12:37:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.39 [2019-03-28 12:37:30,055 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 67.97/34.39 [2019-03-28 12:37:30,100 INFO L216 LassoAnalysis]: Preferences: 67.97/34.39 [2019-03-28 12:37:30,101 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 67.97/34.39 [2019-03-28 12:37:30,101 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 67.97/34.39 [2019-03-28 12:37:30,101 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 67.97/34.39 [2019-03-28 12:37:30,101 INFO L127 ssoRankerPreferences]: Use exernal solver: false 67.97/34.39 [2019-03-28 12:37:30,101 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 67.97/34.39 [2019-03-28 12:37:30,101 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 67.97/34.39 [2019-03-28 12:37:30,101 INFO L130 ssoRankerPreferences]: Path of dumped script: 67.97/34.39 [2019-03-28 12:37:30,102 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Lasso 67.97/34.39 [2019-03-28 12:37:30,102 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 67.97/34.39 [2019-03-28 12:37:30,102 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 67.97/34.39 [2019-03-28 12:37:30,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:30,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:30,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:30,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:30,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:30,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:30,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:30,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:30,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:30,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:30,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:30,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:30,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:30,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.39 [2019-03-28 12:37:30,545 INFO L300 LassoAnalysis]: Preprocessing complete. 67.97/34.39 [2019-03-28 12:37:30,545 INFO L497 LassoAnalysis]: Using template 'affine'. 67.97/34.39 [2019-03-28 12:37:30,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.39 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.39 Number of strict supporting invariants: 0 67.97/34.39 Number of non-strict supporting invariants: 1 67.97/34.39 Consider only non-deceasing supporting invariants: true 67.97/34.39 Simplify termination arguments: true 67.97/34.39 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.39 [2019-03-28 12:37:30,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.39 [2019-03-28 12:37:30,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.39 [2019-03-28 12:37:30,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:30,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:30,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:30,547 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:30,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:30,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:30,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:30,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:30,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:30,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:30,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:30,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:30,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:30,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:30,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:30,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:30,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:30,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:30,553 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:30,553 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:30,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:30,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:30,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:30,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:30,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:30,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:30,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:30,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:30,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:30,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:30,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:30,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.40 [2019-03-28 12:37:30,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:30,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:30,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:30,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:30,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:30,565 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 67.97/34.40 [2019-03-28 12:37:30,566 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 67.97/34.40 [2019-03-28 12:37:30,566 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 67.97/34.40 [2019-03-28 12:37:30,566 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 67.97/34.40 [2019-03-28 12:37:30,566 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 67.97/34.40 [2019-03-28 12:37:30,567 INFO L518 LassoAnalysis]: Proved termination. 67.97/34.40 [2019-03-28 12:37:30,567 INFO L520 LassoAnalysis]: Termination argument consisting of: 67.97/34.40 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6 67.97/34.40 Supporting invariants [] 67.97/34.40 [2019-03-28 12:37:30,595 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed 67.97/34.40 [2019-03-28 12:37:30,596 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.97/34.40 [2019-03-28 12:37:30,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.40 [2019-03-28 12:37:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:30,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:30,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:30,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:30,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:30,722 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:30,723 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 67 67.97/34.40 [2019-03-28 12:37:30,731 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:30,775 INFO L497 ElimStorePlain]: treesize reduction 56, result has 36.4 percent of original size 67.97/34.40 [2019-03-28 12:37:30,776 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:30,776 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:28 67.97/34.40 [2019-03-28 12:37:30,820 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:30,821 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 67.97/34.40 [2019-03-28 12:37:30,822 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:30,829 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 67.97/34.40 [2019-03-28 12:37:30,830 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:30,848 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:30,849 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:30,850 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:13 67.97/34.40 [2019-03-28 12:37:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.97/34.40 [2019-03-28 12:37:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:30,981 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 67.97/34.40 [2019-03-28 12:37:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:30,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:30,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:31,014 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 16 67.97/34.40 [2019-03-28 12:37:31,015 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:31,019 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:31,019 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:31,020 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 67.97/34.40 [2019-03-28 12:37:31,038 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:31,038 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 67.97/34.40 [2019-03-28 12:37:31,039 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:31,058 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size 67.97/34.40 [2019-03-28 12:37:31,058 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 67.97/34.40 [2019-03-28 12:37:31,058 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 67.97/34.40 [2019-03-28 12:37:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:31,408 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 67.97/34.40 [2019-03-28 12:37:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:31,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:31,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:31,434 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:31,434 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 42 67.97/34.40 [2019-03-28 12:37:31,435 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:31,455 INFO L497 ElimStorePlain]: treesize reduction 16, result has 59.0 percent of original size 67.97/34.40 [2019-03-28 12:37:31,455 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 67.97/34.40 [2019-03-28 12:37:31,455 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 67.97/34.40 [2019-03-28 12:37:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:31,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:31,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:32,049 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:32,049 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 69 67.97/34.40 [2019-03-28 12:37:32,055 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:32,103 INFO L497 ElimStorePlain]: treesize reduction 63, result has 35.7 percent of original size 67.97/34.40 [2019-03-28 12:37:32,104 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:32,104 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:30 67.97/34.40 [2019-03-28 12:37:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:32,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:32,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:32,266 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:32,266 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 67 67.97/34.40 [2019-03-28 12:37:32,272 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:32,312 INFO L497 ElimStorePlain]: treesize reduction 63, result has 34.4 percent of original size 67.97/34.40 [2019-03-28 12:37:32,312 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:32,312 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:28 67.97/34.40 [2019-03-28 12:37:32,326 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 67.97/34.40 [2019-03-28 12:37:32,326 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:32,335 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:32,336 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 67.97/34.40 [2019-03-28 12:37:32,336 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:32,354 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:32,354 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:32,355 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:13 67.97/34.40 [2019-03-28 12:37:32,379 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 21 predicates after loop cannibalization 67.97/34.40 [2019-03-28 12:37:32,379 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 21 loop predicates 67.97/34.40 [2019-03-28 12:37:32,379 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 129 states and 166 transitions. cyclomatic complexity: 43 Second operand 10 states. 67.97/34.40 [2019-03-28 12:37:36,039 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 129 states and 166 transitions. cyclomatic complexity: 43. Second operand 10 states. Result 878 states and 1075 transitions. Complement of second has 254 states. 67.97/34.40 [2019-03-28 12:37:36,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 43 states 1 stem states 39 non-accepting loop states 3 accepting loop states 67.97/34.40 [2019-03-28 12:37:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 67.97/34.40 [2019-03-28 12:37:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 136 transitions. 67.97/34.40 [2019-03-28 12:37:36,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 136 transitions. Stem has 4 letters. Loop has 12 letters. 67.97/34.40 [2019-03-28 12:37:36,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.97/34.40 [2019-03-28 12:37:36,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 136 transitions. Stem has 16 letters. Loop has 12 letters. 67.97/34.40 [2019-03-28 12:37:36,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.97/34.40 [2019-03-28 12:37:36,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 136 transitions. Stem has 4 letters. Loop has 24 letters. 67.97/34.40 [2019-03-28 12:37:36,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.97/34.40 [2019-03-28 12:37:36,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 878 states and 1075 transitions. 67.97/34.40 [2019-03-28 12:37:36,078 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 217 67.97/34.40 [2019-03-28 12:37:36,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 878 states to 465 states and 570 transitions. 67.97/34.40 [2019-03-28 12:37:36,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 67.97/34.40 [2019-03-28 12:37:36,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 67.97/34.40 [2019-03-28 12:37:36,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 465 states and 570 transitions. 67.97/34.40 [2019-03-28 12:37:36,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 67.97/34.40 [2019-03-28 12:37:36,082 INFO L706 BuchiCegarLoop]: Abstraction has 465 states and 570 transitions. 67.97/34.40 [2019-03-28 12:37:36,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states and 570 transitions. 67.97/34.40 [2019-03-28 12:37:36,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 205. 67.97/34.40 [2019-03-28 12:37:36,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. 67.97/34.40 [2019-03-28 12:37:36,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 263 transitions. 67.97/34.40 [2019-03-28 12:37:36,090 INFO L729 BuchiCegarLoop]: Abstraction has 205 states and 263 transitions. 67.97/34.40 [2019-03-28 12:37:36,090 INFO L609 BuchiCegarLoop]: Abstraction has 205 states and 263 transitions. 67.97/34.40 [2019-03-28 12:37:36,090 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ 67.97/34.40 [2019-03-28 12:37:36,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 205 states and 263 transitions. 67.97/34.40 [2019-03-28 12:37:36,091 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 96 67.97/34.40 [2019-03-28 12:37:36,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 67.97/34.40 [2019-03-28 12:37:36,092 INFO L119 BuchiIsEmpty]: Starting construction of run 67.97/34.40 [2019-03-28 12:37:36,092 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 67.97/34.40 [2019-03-28 12:37:36,093 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 67.97/34.40 [2019-03-28 12:37:36,094 INFO L794 eck$LassoCheckResult]: Stem: 4481#ULTIMATE.startENTRY [120] 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] 4471#L-1 [186] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 4472#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 4496#L8-1 [192] L8-1-->L8-2: Formula: (and (< |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 4510#L8-2 67.97/34.40 [2019-03-28 12:37:36,095 INFO L796 eck$LassoCheckResult]: Loop: 4510#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 4445#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 4585#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 4583#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 4581#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 4579#L9-1 [161] L9-1-->L17: Formula: (>= 0 |v_ULTIMATE.start_main_#t~mem5_6|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 4578#L17 [208] L17-->L18: Formula: (> |v_ULTIMATE.start_main_#t~nondet10_3| 0) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_3|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10] 4577#L18 [93] L18-->L18-1: Formula: (and (= (select |v_#valid_22| v_ULTIMATE.start_main_~x~0.base_16) 1) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_20| v_ULTIMATE.start_main_~x~0.base_16)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12) |v_ULTIMATE.start_main_#t~mem11_2|)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 4568#L18-1 [255] L18-1-->L17-2: Formula: (and (= |v_#memory_int_26| (store |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26) v_ULTIMATE.start_main_~x~0.offset_19 (+ |v_ULTIMATE.start_main_#t~mem11_6| 1)))) (= 1 (select |v_#valid_44| v_ULTIMATE.start_main_~x~0.base_26)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_19) (<= (+ v_ULTIMATE.start_main_~x~0.offset_19 4) (select |v_#length_33| v_ULTIMATE.start_main_~x~0.base_26))) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, #memory_int] 4541#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 4540#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 4522#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 4521#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 4488#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 4482#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 4467#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 4459#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 4460#L10 [99] L10-->L14: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet6_5|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_5|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 4487#L14 [108] L14-->L14-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~y~0.base_10)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8) |v_ULTIMATE.start_main_#t~mem9_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_16| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 4484#L14-1 [252] L14-1-->L17-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1)))) |v_#memory_int_20|) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_22)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_30| v_ULTIMATE.start_main_~y~0.base_22))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 4435#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 4436#L8-1 [192] L8-1-->L8-2: Formula: (and (< |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 4510#L8-2 67.97/34.40 [2019-03-28 12:37:36,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.40 [2019-03-28 12:37:36,095 INFO L82 PathProgramCache]: Analyzing trace with hash 4681905, now seen corresponding path program 3 times 67.97/34.40 [2019-03-28 12:37:36,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.97/34.40 [2019-03-28 12:37:36,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.97/34.40 [2019-03-28 12:37:36,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:36,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:36,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:36,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.40 [2019-03-28 12:37:36,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1944589440, now seen corresponding path program 1 times 67.97/34.40 [2019-03-28 12:37:36,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.97/34.40 [2019-03-28 12:37:36,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.97/34.40 [2019-03-28 12:37:36,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:36,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:36,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 67.97/34.40 [2019-03-28 12:37:36,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.97/34.40 [2019-03-28 12:37:36,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 67.97/34.40 [2019-03-28 12:37:36,298 INFO L811 eck$LassoCheckResult]: loop already infeasible 67.97/34.40 [2019-03-28 12:37:36,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 67.97/34.40 [2019-03-28 12:37:36,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 67.97/34.40 [2019-03-28 12:37:36,299 INFO L87 Difference]: Start difference. First operand 205 states and 263 transitions. cyclomatic complexity: 66 Second operand 9 states. 67.97/34.40 [2019-03-28 12:37:36,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.97/34.40 [2019-03-28 12:37:36,679 INFO L93 Difference]: Finished difference Result 261 states and 325 transitions. 67.97/34.40 [2019-03-28 12:37:36,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 67.97/34.40 [2019-03-28 12:37:36,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 261 states and 325 transitions. 67.97/34.40 [2019-03-28 12:37:36,686 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 121 67.97/34.40 [2019-03-28 12:37:36,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 261 states to 261 states and 325 transitions. 67.97/34.40 [2019-03-28 12:37:36,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 67.97/34.40 [2019-03-28 12:37:36,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 67.97/34.40 [2019-03-28 12:37:36,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 261 states and 325 transitions. 67.97/34.40 [2019-03-28 12:37:36,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 67.97/34.40 [2019-03-28 12:37:36,689 INFO L706 BuchiCegarLoop]: Abstraction has 261 states and 325 transitions. 67.97/34.40 [2019-03-28 12:37:36,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states and 325 transitions. 67.97/34.40 [2019-03-28 12:37:36,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 208. 67.97/34.40 [2019-03-28 12:37:36,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. 67.97/34.40 [2019-03-28 12:37:36,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 266 transitions. 67.97/34.40 [2019-03-28 12:37:36,694 INFO L729 BuchiCegarLoop]: Abstraction has 208 states and 266 transitions. 67.97/34.40 [2019-03-28 12:37:36,694 INFO L609 BuchiCegarLoop]: Abstraction has 208 states and 266 transitions. 67.97/34.40 [2019-03-28 12:37:36,694 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ 67.97/34.40 [2019-03-28 12:37:36,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 208 states and 266 transitions. 67.97/34.40 [2019-03-28 12:37:36,696 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 98 67.97/34.40 [2019-03-28 12:37:36,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 67.97/34.40 [2019-03-28 12:37:36,696 INFO L119 BuchiIsEmpty]: Starting construction of run 67.97/34.40 [2019-03-28 12:37:36,697 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 67.97/34.40 [2019-03-28 12:37:36,697 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 67.97/34.40 [2019-03-28 12:37:36,697 INFO L794 eck$LassoCheckResult]: Stem: 4977#ULTIMATE.startENTRY [120] 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] 4967#L-1 [186] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 4968#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 5009#L8-1 [192] L8-1-->L8-2: Formula: (and (< |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5063#L8-2 67.97/34.40 [2019-03-28 12:37:36,698 INFO L796 eck$LassoCheckResult]: Loop: 5063#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 4939#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 4940#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5037#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 5038#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 5033#L9-1 [161] L9-1-->L17: Formula: (>= 0 |v_ULTIMATE.start_main_#t~mem5_6|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 5034#L17 [208] L17-->L18: Formula: (> |v_ULTIMATE.start_main_#t~nondet10_3| 0) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_3|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10] 5029#L18 [93] L18-->L18-1: Formula: (and (= (select |v_#valid_22| v_ULTIMATE.start_main_~x~0.base_16) 1) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_20| v_ULTIMATE.start_main_~x~0.base_16)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12) |v_ULTIMATE.start_main_#t~mem11_2|)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 5030#L18-1 [255] L18-1-->L17-2: Formula: (and (= |v_#memory_int_26| (store |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26) v_ULTIMATE.start_main_~x~0.offset_19 (+ |v_ULTIMATE.start_main_#t~mem11_6| 1)))) (= 1 (select |v_#valid_44| v_ULTIMATE.start_main_~x~0.base_26)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_19) (<= (+ v_ULTIMATE.start_main_~x~0.offset_19 4) (select |v_#length_33| v_ULTIMATE.start_main_~x~0.base_26))) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, #memory_int] 5025#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 5024#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5023#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 5022#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 5021#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5020#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 4962#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 4963#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 4989#L10 [205] L10-->L11: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet6_3|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_3|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 4970#L11 [122] L11-->L11-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_4|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_4|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 4973#L11-1 [253] L11-1-->L12: Formula: (and (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_25 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_25) v_ULTIMATE.start_main_~x~0.offset_18 (+ |v_ULTIMATE.start_main_#t~mem7_6| (- 1))))) (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~x~0.base_25)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_18 4) (select |v_#length_31| v_ULTIMATE.start_main_~x~0.base_25)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_18)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_31|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_31|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 4974#L12 [256] L12-->L17-2: Formula: (and (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~y~0.base_24 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~y~0.base_24) v_ULTIMATE.start_main_~y~0.offset_18 |v_ULTIMATE.start_main_#t~nondet8_5|)) |v_#memory_int_28|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_18 4) (select |v_#length_34| v_ULTIMATE.start_main_~y~0.base_24)) (= 1 (select |v_#valid_45| v_ULTIMATE.start_main_~y~0.base_24)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_18)) InVars {#valid=|v_#valid_45|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_24, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_18, #length=|v_#length_34|} OutVars{#valid=|v_#valid_45|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_24, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_18, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8, #memory_int] 4933#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 4934#L8-1 [192] L8-1-->L8-2: Formula: (and (< |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5063#L8-2 67.97/34.40 [2019-03-28 12:37:36,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.40 [2019-03-28 12:37:36,698 INFO L82 PathProgramCache]: Analyzing trace with hash 4681905, now seen corresponding path program 4 times 67.97/34.40 [2019-03-28 12:37:36,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.97/34.40 [2019-03-28 12:37:36,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.97/34.40 [2019-03-28 12:37:36,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:36,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:36,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:36,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.40 [2019-03-28 12:37:36,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1094483233, now seen corresponding path program 1 times 67.97/34.40 [2019-03-28 12:37:36,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.97/34.40 [2019-03-28 12:37:36,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.97/34.40 [2019-03-28 12:37:36,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:36,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:36,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:36,915 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.97/34.40 [2019-03-28 12:37:36,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 67.97/34.40 [2019-03-28 12:37:36,915 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 67.97/34.40 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 67.97/34.40 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 67.97/34.40 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 67.97/34.40 [2019-03-28 12:37:36,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:36,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:36,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:36,979 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:36,979 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 67.97/34.40 [2019-03-28 12:37:36,981 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 67.97/34.40 [2019-03-28 12:37:36,988 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:36,989 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. 67.97/34.40 [2019-03-28 12:37:36,989 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 67.97/34.40 [2019-03-28 12:37:37,042 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 67.97/34.40 [2019-03-28 12:37:37,043 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:37,048 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 67.97/34.40 [2019-03-28 12:37:37,049 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:37,063 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:37,064 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 67.97/34.40 [2019-03-28 12:37:37,064 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:25 67.97/34.40 [2019-03-28 12:37:37,088 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 67.97/34.40 [2019-03-28 12:37:37,089 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:37,095 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 67.97/34.40 [2019-03-28 12:37:37,096 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:37,111 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:37,111 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:37,112 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 67.97/34.40 [2019-03-28 12:37:37,115 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 67.97/34.40 [2019-03-28 12:37:37,116 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:37,118 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:37,118 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:37,118 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 67.97/34.40 [2019-03-28 12:37:37,120 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.97/34.40 [2019-03-28 12:37:37,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 67.97/34.40 [2019-03-28 12:37:37,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 67.97/34.40 [2019-03-28 12:37:37,149 INFO L811 eck$LassoCheckResult]: loop already infeasible 67.97/34.40 [2019-03-28 12:37:37,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. 67.97/34.40 [2019-03-28 12:37:37,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 67.97/34.40 [2019-03-28 12:37:37,150 INFO L87 Difference]: Start difference. First operand 208 states and 266 transitions. cyclomatic complexity: 66 Second operand 14 states. 67.97/34.40 [2019-03-28 12:37:37,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.97/34.40 [2019-03-28 12:37:37,538 INFO L93 Difference]: Finished difference Result 273 states and 340 transitions. 67.97/34.40 [2019-03-28 12:37:37,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 67.97/34.40 [2019-03-28 12:37:37,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 273 states and 340 transitions. 67.97/34.40 [2019-03-28 12:37:37,545 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 152 67.97/34.40 [2019-03-28 12:37:37,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 273 states to 273 states and 340 transitions. 67.97/34.40 [2019-03-28 12:37:37,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 67.97/34.40 [2019-03-28 12:37:37,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 67.97/34.40 [2019-03-28 12:37:37,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 273 states and 340 transitions. 67.97/34.40 [2019-03-28 12:37:37,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 67.97/34.40 [2019-03-28 12:37:37,547 INFO L706 BuchiCegarLoop]: Abstraction has 273 states and 340 transitions. 67.97/34.40 [2019-03-28 12:37:37,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states and 340 transitions. 67.97/34.40 [2019-03-28 12:37:37,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 208. 67.97/34.40 [2019-03-28 12:37:37,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. 67.97/34.40 [2019-03-28 12:37:37,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 266 transitions. 67.97/34.40 [2019-03-28 12:37:37,553 INFO L729 BuchiCegarLoop]: Abstraction has 208 states and 266 transitions. 67.97/34.40 [2019-03-28 12:37:37,553 INFO L609 BuchiCegarLoop]: Abstraction has 208 states and 266 transitions. 67.97/34.40 [2019-03-28 12:37:37,553 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ 67.97/34.40 [2019-03-28 12:37:37,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 208 states and 266 transitions. 67.97/34.40 [2019-03-28 12:37:37,554 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 98 67.97/34.40 [2019-03-28 12:37:37,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 67.97/34.40 [2019-03-28 12:37:37,554 INFO L119 BuchiIsEmpty]: Starting construction of run 67.97/34.40 [2019-03-28 12:37:37,555 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 67.97/34.40 [2019-03-28 12:37:37,555 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] 67.97/34.40 [2019-03-28 12:37:37,556 INFO L794 eck$LassoCheckResult]: Stem: 5570#ULTIMATE.startENTRY [120] 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] 5560#L-1 [186] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 5561#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 5611#L8-1 [192] L8-1-->L8-2: Formula: (and (< |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5652#L8-2 67.97/34.40 [2019-03-28 12:37:37,556 INFO L796 eck$LassoCheckResult]: Loop: 5652#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 5531#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 5532#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5650#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 5649#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 5648#L9-1 [161] L9-1-->L17: Formula: (>= 0 |v_ULTIMATE.start_main_#t~mem5_6|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 5645#L17 [208] L17-->L18: Formula: (> |v_ULTIMATE.start_main_#t~nondet10_3| 0) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_3|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10] 5625#L18 [93] L18-->L18-1: Formula: (and (= (select |v_#valid_22| v_ULTIMATE.start_main_~x~0.base_16) 1) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_20| v_ULTIMATE.start_main_~x~0.base_16)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12) |v_ULTIMATE.start_main_#t~mem11_2|)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 5619#L18-1 [255] L18-1-->L17-2: Formula: (and (= |v_#memory_int_26| (store |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26) v_ULTIMATE.start_main_~x~0.offset_19 (+ |v_ULTIMATE.start_main_#t~mem11_6| 1)))) (= 1 (select |v_#valid_44| v_ULTIMATE.start_main_~x~0.base_26)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_19) (<= (+ v_ULTIMATE.start_main_~x~0.offset_19 4) (select |v_#length_33| v_ULTIMATE.start_main_~x~0.base_26))) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, #memory_int] 5616#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 5615#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5614#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 5613#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 5578#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5579#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 5605#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 5585#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 5583#L10 [99] L10-->L14: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet6_5|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_5|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 5577#L14 [108] L14-->L14-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~y~0.base_10)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8) |v_ULTIMATE.start_main_#t~mem9_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_16| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 5574#L14-1 [252] L14-1-->L17-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1)))) |v_#memory_int_20|) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_22)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_30| v_ULTIMATE.start_main_~y~0.base_22))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 5571#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 5646#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5647#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 5623#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 5624#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5600#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 5601#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 5595#L9-1 [161] L9-1-->L17: Formula: (>= 0 |v_ULTIMATE.start_main_#t~mem5_6|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 5549#L17 [208] L17-->L18: Formula: (> |v_ULTIMATE.start_main_#t~nondet10_3| 0) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_3|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10] 5545#L18 [93] L18-->L18-1: Formula: (and (= (select |v_#valid_22| v_ULTIMATE.start_main_~x~0.base_16) 1) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_20| v_ULTIMATE.start_main_~x~0.base_16)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12) |v_ULTIMATE.start_main_#t~mem11_2|)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 5546#L18-1 [255] L18-1-->L17-2: Formula: (and (= |v_#memory_int_26| (store |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26) v_ULTIMATE.start_main_~x~0.offset_19 (+ |v_ULTIMATE.start_main_#t~mem11_6| 1)))) (= 1 (select |v_#valid_44| v_ULTIMATE.start_main_~x~0.base_26)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_19) (<= (+ v_ULTIMATE.start_main_~x~0.offset_19 4) (select |v_#length_33| v_ULTIMATE.start_main_~x~0.base_26))) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, #memory_int] 5524#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 5525#L8-1 [192] L8-1-->L8-2: Formula: (and (< |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5652#L8-2 67.97/34.40 [2019-03-28 12:37:37,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.40 [2019-03-28 12:37:37,557 INFO L82 PathProgramCache]: Analyzing trace with hash 4681905, now seen corresponding path program 5 times 67.97/34.40 [2019-03-28 12:37:37,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.97/34.40 [2019-03-28 12:37:37,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.97/34.40 [2019-03-28 12:37:37,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:37,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:37,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:37,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.40 [2019-03-28 12:37:37,566 INFO L82 PathProgramCache]: Analyzing trace with hash -335253231, now seen corresponding path program 2 times 67.97/34.40 [2019-03-28 12:37:37,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.97/34.40 [2019-03-28 12:37:37,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.97/34.40 [2019-03-28 12:37:37,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:37,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:37,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:37,596 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. 67.97/34.40 [2019-03-28 12:37:37,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.97/34.40 [2019-03-28 12:37:37,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 67.97/34.40 [2019-03-28 12:37:37,597 INFO L811 eck$LassoCheckResult]: loop already infeasible 67.97/34.40 [2019-03-28 12:37:37,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 67.97/34.40 [2019-03-28 12:37:37,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 67.97/34.40 [2019-03-28 12:37:37,598 INFO L87 Difference]: Start difference. First operand 208 states and 266 transitions. cyclomatic complexity: 66 Second operand 5 states. 67.97/34.40 [2019-03-28 12:37:37,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.97/34.40 [2019-03-28 12:37:37,688 INFO L93 Difference]: Finished difference Result 180 states and 206 transitions. 67.97/34.40 [2019-03-28 12:37:37,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 67.97/34.40 [2019-03-28 12:37:37,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 206 transitions. 67.97/34.40 [2019-03-28 12:37:37,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 67.97/34.40 [2019-03-28 12:37:37,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 124 states and 149 transitions. 67.97/34.40 [2019-03-28 12:37:37,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 67.97/34.40 [2019-03-28 12:37:37,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 67.97/34.40 [2019-03-28 12:37:37,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 149 transitions. 67.97/34.40 [2019-03-28 12:37:37,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 67.97/34.40 [2019-03-28 12:37:37,696 INFO L706 BuchiCegarLoop]: Abstraction has 124 states and 149 transitions. 67.97/34.40 [2019-03-28 12:37:37,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 149 transitions. 67.97/34.40 [2019-03-28 12:37:37,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 94. 67.97/34.40 [2019-03-28 12:37:37,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. 67.97/34.40 [2019-03-28 12:37:37,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 117 transitions. 67.97/34.40 [2019-03-28 12:37:37,698 INFO L729 BuchiCegarLoop]: Abstraction has 94 states and 117 transitions. 67.97/34.40 [2019-03-28 12:37:37,698 INFO L609 BuchiCegarLoop]: Abstraction has 94 states and 117 transitions. 67.97/34.40 [2019-03-28 12:37:37,698 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ 67.97/34.40 [2019-03-28 12:37:37,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 117 transitions. 67.97/34.40 [2019-03-28 12:37:37,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 67.97/34.40 [2019-03-28 12:37:37,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 67.97/34.40 [2019-03-28 12:37:37,699 INFO L119 BuchiIsEmpty]: Starting construction of run 67.97/34.40 [2019-03-28 12:37:37,700 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 67.97/34.40 [2019-03-28 12:37:37,700 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 67.97/34.40 [2019-03-28 12:37:37,700 INFO L794 eck$LassoCheckResult]: Stem: 5956#ULTIMATE.startENTRY [120] 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] 5945#L-1 [187] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 5947#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 5987#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5932#L8-2 67.97/34.40 [2019-03-28 12:37:37,701 INFO L796 eck$LassoCheckResult]: Loop: 5932#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 5928#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 5929#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5957#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 5942#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 5937#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 5938#L10 [99] L10-->L14: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet6_5|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_5|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 5962#L14 [108] L14-->L14-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~y~0.base_10)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8) |v_ULTIMATE.start_main_#t~mem9_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_16| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 5959#L14-1 [252] L14-1-->L17-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1)))) |v_#memory_int_20|) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_22)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_30| v_ULTIMATE.start_main_~y~0.base_22))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 5924#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 5925#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5932#L8-2 67.97/34.40 [2019-03-28 12:37:37,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.40 [2019-03-28 12:37:37,701 INFO L82 PathProgramCache]: Analyzing trace with hash 4682867, now seen corresponding path program 1 times 67.97/34.40 [2019-03-28 12:37:37,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.97/34.40 [2019-03-28 12:37:37,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.97/34.40 [2019-03-28 12:37:37,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:37,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:37,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:37,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.40 [2019-03-28 12:37:37,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1817108146, now seen corresponding path program 4 times 67.97/34.40 [2019-03-28 12:37:37,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.97/34.40 [2019-03-28 12:37:37,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.97/34.40 [2019-03-28 12:37:37,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:37,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:37,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:37,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.40 [2019-03-28 12:37:37,720 INFO L82 PathProgramCache]: Analyzing trace with hash 900894464, now seen corresponding path program 1 times 67.97/34.40 [2019-03-28 12:37:37,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.97/34.40 [2019-03-28 12:37:37,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.97/34.40 [2019-03-28 12:37:37,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:37,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:37,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:37,973 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 67.97/34.40 [2019-03-28 12:37:38,021 INFO L216 LassoAnalysis]: Preferences: 67.97/34.40 [2019-03-28 12:37:38,022 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 67.97/34.40 [2019-03-28 12:37:38,022 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 67.97/34.40 [2019-03-28 12:37:38,022 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 67.97/34.40 [2019-03-28 12:37:38,022 INFO L127 ssoRankerPreferences]: Use exernal solver: false 67.97/34.40 [2019-03-28 12:37:38,022 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 67.97/34.40 [2019-03-28 12:37:38,022 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 67.97/34.40 [2019-03-28 12:37:38,023 INFO L130 ssoRankerPreferences]: Path of dumped script: 67.97/34.40 [2019-03-28 12:37:38,023 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration13_Lasso 67.97/34.40 [2019-03-28 12:37:38,023 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 67.97/34.40 [2019-03-28 12:37:38,023 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 67.97/34.40 [2019-03-28 12:37:38,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:38,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:38,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:38,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:38,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:38,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:38,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:38,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:38,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:38,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:38,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:38,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:38,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:38,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:38,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:38,458 INFO L300 LassoAnalysis]: Preprocessing complete. 67.97/34.40 [2019-03-28 12:37:38,459 INFO L497 LassoAnalysis]: Using template 'affine'. 67.97/34.40 [2019-03-28 12:37:38,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:38,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:38,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:38,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:38,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:38,461 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:38,461 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:38,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:38,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:38,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:38,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:38,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:38,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:38,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:38,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:38,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:38,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:38,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:38,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.40 [2019-03-28 12:37:38,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:38,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:38,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:38,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:38,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:38,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:38,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:38,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:38,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.40 [2019-03-28 12:37:38,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:38,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:38,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:38,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:38,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:38,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:38,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:38,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:38,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.40 [2019-03-28 12:37:38,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:38,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:38,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:38,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:38,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:38,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:38,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:38,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:38,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.40 [2019-03-28 12:37:38,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:38,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:38,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:38,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:38,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:38,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:38,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:38,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:38,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.40 [2019-03-28 12:37:38,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:38,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:38,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:38,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:38,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:38,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:38,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:38,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:38,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:38,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:38,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:38,477 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:38,477 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:38,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:38,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:38,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:38,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:38,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:38,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:38,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:38,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:38,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:38,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:38,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:38,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:38,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:38,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:38,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:38,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:38,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:38,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:38,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:38,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.40 [2019-03-28 12:37:38,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:38,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:38,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:38,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:38,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:38,497 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 67.97/34.40 [2019-03-28 12:37:38,498 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 67.97/34.40 [2019-03-28 12:37:38,498 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 67.97/34.40 [2019-03-28 12:37:38,498 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 67.97/34.40 [2019-03-28 12:37:38,498 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 67.97/34.40 [2019-03-28 12:37:38,498 INFO L518 LassoAnalysis]: Proved termination. 67.97/34.40 [2019-03-28 12:37:38,499 INFO L520 LassoAnalysis]: Termination argument consisting of: 67.97/34.40 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_7) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_7 67.97/34.40 Supporting invariants [] 67.97/34.40 [2019-03-28 12:37:38,537 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed 67.97/34.40 [2019-03-28 12:37:38,539 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.97/34.40 [2019-03-28 12:37:38,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.40 [2019-03-28 12:37:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:38,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:38,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:38,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:38,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:38,613 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 35 treesize of output 19 67.97/34.40 [2019-03-28 12:37:38,614 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:38,619 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:38,619 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:38,619 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 67.97/34.40 [2019-03-28 12:37:38,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.97/34.40 [2019-03-28 12:37:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:38,702 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 67.97/34.40 [2019-03-28 12:37:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:38,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:38,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:38,728 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 16 67.97/34.40 [2019-03-28 12:37:38,729 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:38,733 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:38,734 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:38,734 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 67.97/34.40 [2019-03-28 12:37:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:38,774 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 67.97/34.40 [2019-03-28 12:37:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:38,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:38,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:38,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:38,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:38,836 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 35 treesize of output 19 67.97/34.40 [2019-03-28 12:37:38,837 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:38,844 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:38,844 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:38,845 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 67.97/34.40 [2019-03-28 12:37:38,884 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 6 predicates after loop cannibalization 67.97/34.40 [2019-03-28 12:37:38,884 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates 67.97/34.40 [2019-03-28 12:37:38,884 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 94 states and 117 transitions. cyclomatic complexity: 28 Second operand 7 states. 67.97/34.40 [2019-03-28 12:37:39,076 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 94 states and 117 transitions. cyclomatic complexity: 28. Second operand 7 states. Result 186 states and 224 transitions. Complement of second has 42 states. 67.97/34.40 [2019-03-28 12:37:39,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states 67.97/34.40 [2019-03-28 12:37:39,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 67.97/34.40 [2019-03-28 12:37:39,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 64 transitions. 67.97/34.40 [2019-03-28 12:37:39,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 64 transitions. Stem has 4 letters. Loop has 11 letters. 67.97/34.40 [2019-03-28 12:37:39,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.97/34.40 [2019-03-28 12:37:39,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 64 transitions. Stem has 15 letters. Loop has 11 letters. 67.97/34.40 [2019-03-28 12:37:39,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.97/34.40 [2019-03-28 12:37:39,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 64 transitions. Stem has 4 letters. Loop has 22 letters. 67.97/34.40 [2019-03-28 12:37:39,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.97/34.40 [2019-03-28 12:37:39,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 224 transitions. 67.97/34.40 [2019-03-28 12:37:39,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 67.97/34.40 [2019-03-28 12:37:39,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 131 states and 158 transitions. 67.97/34.40 [2019-03-28 12:37:39,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 67.97/34.40 [2019-03-28 12:37:39,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 67.97/34.40 [2019-03-28 12:37:39,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 158 transitions. 67.97/34.40 [2019-03-28 12:37:39,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 67.97/34.40 [2019-03-28 12:37:39,085 INFO L706 BuchiCegarLoop]: Abstraction has 131 states and 158 transitions. 67.97/34.40 [2019-03-28 12:37:39,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 158 transitions. 67.97/34.40 [2019-03-28 12:37:39,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 86. 67.97/34.40 [2019-03-28 12:37:39,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. 67.97/34.40 [2019-03-28 12:37:39,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. 67.97/34.40 [2019-03-28 12:37:39,088 INFO L729 BuchiCegarLoop]: Abstraction has 86 states and 108 transitions. 67.97/34.40 [2019-03-28 12:37:39,088 INFO L609 BuchiCegarLoop]: Abstraction has 86 states and 108 transitions. 67.97/34.40 [2019-03-28 12:37:39,088 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ 67.97/34.40 [2019-03-28 12:37:39,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 108 transitions. 67.97/34.40 [2019-03-28 12:37:39,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 67.97/34.40 [2019-03-28 12:37:39,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 67.97/34.40 [2019-03-28 12:37:39,089 INFO L119 BuchiIsEmpty]: Starting construction of run 67.97/34.40 [2019-03-28 12:37:39,089 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 67.97/34.40 [2019-03-28 12:37:39,089 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] 67.97/34.40 [2019-03-28 12:37:39,090 INFO L794 eck$LassoCheckResult]: Stem: 6500#ULTIMATE.startENTRY [120] 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] 6491#L-1 [186] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 6492#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 6525#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 6475#L8-2 67.97/34.40 [2019-03-28 12:37:39,090 INFO L796 eck$LassoCheckResult]: Loop: 6475#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 6471#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 6472#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 6501#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 6488#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 6482#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 6483#L10 [205] L10-->L11: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet6_3|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_3|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 6494#L11 [122] L11-->L11-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_4|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_4|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 6496#L11-1 [253] L11-1-->L12: Formula: (and (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_25 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_25) v_ULTIMATE.start_main_~x~0.offset_18 (+ |v_ULTIMATE.start_main_#t~mem7_6| (- 1))))) (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~x~0.base_25)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_18 4) (select |v_#length_31| v_ULTIMATE.start_main_~x~0.base_25)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_18)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_31|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_31|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 6497#L12 [256] L12-->L17-2: Formula: (and (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~y~0.base_24 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~y~0.base_24) v_ULTIMATE.start_main_~y~0.offset_18 |v_ULTIMATE.start_main_#t~nondet8_5|)) |v_#memory_int_28|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_18 4) (select |v_#length_34| v_ULTIMATE.start_main_~y~0.base_24)) (= 1 (select |v_#valid_45| v_ULTIMATE.start_main_~y~0.base_24)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_18)) InVars {#valid=|v_#valid_45|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_24, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_18, #length=|v_#length_34|} OutVars{#valid=|v_#valid_45|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_24, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_18, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8, #memory_int] 6466#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 6467#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 6550#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 6473#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 6474#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 6502#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 6489#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 6484#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 6485#L10 [99] L10-->L14: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet6_5|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_5|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 6495#L14 [108] L14-->L14-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~y~0.base_10)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8) |v_ULTIMATE.start_main_#t~mem9_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_16| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 6503#L14-1 [252] L14-1-->L17-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1)))) |v_#memory_int_20|) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_22)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_30| v_ULTIMATE.start_main_~y~0.base_22))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 6468#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 6470#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 6475#L8-2 67.97/34.40 [2019-03-28 12:37:39,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.40 [2019-03-28 12:37:39,091 INFO L82 PathProgramCache]: Analyzing trace with hash 4681906, now seen corresponding path program 1 times 67.97/34.40 [2019-03-28 12:37:39,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.97/34.40 [2019-03-28 12:37:39,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.97/34.40 [2019-03-28 12:37:39,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:39,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:39,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:39,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.40 [2019-03-28 12:37:39,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1761686308, now seen corresponding path program 1 times 67.97/34.40 [2019-03-28 12:37:39,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.97/34.40 [2019-03-28 12:37:39,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.97/34.40 [2019-03-28 12:37:39,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:39,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:39,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:39,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.40 [2019-03-28 12:37:39,113 INFO L82 PathProgramCache]: Analyzing trace with hash -194016429, now seen corresponding path program 1 times 67.97/34.40 [2019-03-28 12:37:39,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.97/34.40 [2019-03-28 12:37:39,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.97/34.40 [2019-03-28 12:37:39,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:39,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:39,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:39,371 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 67.97/34.40 [2019-03-28 12:37:39,521 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 67.97/34.40 [2019-03-28 12:37:39,572 INFO L216 LassoAnalysis]: Preferences: 67.97/34.40 [2019-03-28 12:37:39,573 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 67.97/34.40 [2019-03-28 12:37:39,573 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 67.97/34.40 [2019-03-28 12:37:39,573 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 67.97/34.40 [2019-03-28 12:37:39,573 INFO L127 ssoRankerPreferences]: Use exernal solver: false 67.97/34.40 [2019-03-28 12:37:39,573 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 67.97/34.40 [2019-03-28 12:37:39,573 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 67.97/34.40 [2019-03-28 12:37:39,573 INFO L130 ssoRankerPreferences]: Path of dumped script: 67.97/34.40 [2019-03-28 12:37:39,573 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration14_Lasso 67.97/34.40 [2019-03-28 12:37:39,574 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 67.97/34.40 [2019-03-28 12:37:39,574 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 67.97/34.40 [2019-03-28 12:37:39,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:39,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:39,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:39,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:39,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:39,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:39,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:39,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:39,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:39,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:39,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:39,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:39,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:39,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:40,126 INFO L300 LassoAnalysis]: Preprocessing complete. 67.97/34.40 [2019-03-28 12:37:40,126 INFO L497 LassoAnalysis]: Using template 'affine'. 67.97/34.40 [2019-03-28 12:37:40,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:40,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:40,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.40 [2019-03-28 12:37:40,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:40,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:40,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:40,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:40,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:40,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:40,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:40,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:40,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:40,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:40,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:40,131 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:40,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:40,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:40,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:40,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:40,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:40,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:40,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:40,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:40,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:40,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:40,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:40,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:40,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.40 [2019-03-28 12:37:40,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:40,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:40,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:40,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:40,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:40,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:40,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:40,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:40,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:40,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:40,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:40,139 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:40,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:40,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:40,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:40,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:40,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:40,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:40,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:40,146 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:40,146 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:40,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:40,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:40,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:40,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:40,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:40,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:40,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:40,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:40,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:40,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:40,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:40,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:40,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:40,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:40,158 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:40,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:40,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:40,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:40,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:40,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.40 [2019-03-28 12:37:40,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:40,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:40,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:40,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:40,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:40,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:40,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:40,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:40,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:40,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:40,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:40,164 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:40,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:40,174 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 67.97/34.40 [2019-03-28 12:37:40,181 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 67.97/34.40 [2019-03-28 12:37:40,182 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. 67.97/34.40 [2019-03-28 12:37:40,182 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 67.97/34.40 [2019-03-28 12:37:40,183 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 67.97/34.40 [2019-03-28 12:37:40,183 INFO L518 LassoAnalysis]: Proved termination. 67.97/34.40 [2019-03-28 12:37:40,183 INFO L520 LassoAnalysis]: Termination argument consisting of: 67.97/34.40 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_8) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_8 67.97/34.40 Supporting invariants [] 67.97/34.40 [2019-03-28 12:37:40,210 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed 67.97/34.40 [2019-03-28 12:37:40,213 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.97/34.40 [2019-03-28 12:37:40,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.40 [2019-03-28 12:37:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:40,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:40,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:40,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:40,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:40,334 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 67.97/34.40 [2019-03-28 12:37:40,335 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,342 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:40,342 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,342 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 67.97/34.40 [2019-03-28 12:37:40,362 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.40 [2019-03-28 12:37:40,362 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,369 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:40,369 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,369 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 67.97/34.40 [2019-03-28 12:37:40,375 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 67.97/34.40 [2019-03-28 12:37:40,376 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,387 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:40,387 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,387 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 67.97/34.40 [2019-03-28 12:37:40,388 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 67.97/34.40 [2019-03-28 12:37:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:40,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:40,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:40,503 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 67.97/34.40 [2019-03-28 12:37:40,503 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,512 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:40,512 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,512 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 67.97/34.40 [2019-03-28 12:37:40,517 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.40 [2019-03-28 12:37:40,518 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,526 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:40,527 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,527 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 67.97/34.40 [2019-03-28 12:37:40,543 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 67.97/34.40 [2019-03-28 12:37:40,544 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,553 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:40,553 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,553 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 67.97/34.40 [2019-03-28 12:37:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:40,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:40,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:40,612 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 67.97/34.40 [2019-03-28 12:37:40,612 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,620 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:40,621 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,621 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 67.97/34.40 [2019-03-28 12:37:40,644 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.40 [2019-03-28 12:37:40,645 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,651 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:40,651 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,652 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:14 67.97/34.40 [2019-03-28 12:37:40,660 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 67.97/34.40 [2019-03-28 12:37:40,661 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,667 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:40,668 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,668 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 67.97/34.40 [2019-03-28 12:37:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:40,757 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 67.97/34.40 [2019-03-28 12:37:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:40,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:40,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:40,780 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 67.97/34.40 [2019-03-28 12:37:40,780 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,788 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:40,788 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,788 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:12 67.97/34.40 [2019-03-28 12:37:40,799 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.40 [2019-03-28 12:37:40,799 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,805 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:40,806 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,806 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 67.97/34.40 [2019-03-28 12:37:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:40,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:40,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:40,857 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 67.97/34.40 [2019-03-28 12:37:40,857 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,866 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:40,866 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,866 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 67.97/34.40 [2019-03-28 12:37:40,872 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 67.97/34.40 [2019-03-28 12:37:40,872 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,879 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:40,880 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,880 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 67.97/34.40 [2019-03-28 12:37:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:40,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:40,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:40,903 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 67.97/34.40 [2019-03-28 12:37:40,904 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,922 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:40,923 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,923 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 67.97/34.40 [2019-03-28 12:37:40,930 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 67.97/34.40 [2019-03-28 12:37:40,931 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,938 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:40,939 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,939 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 67.97/34.40 [2019-03-28 12:37:40,944 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.40 [2019-03-28 12:37:40,944 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,951 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:40,952 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,952 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 67.97/34.40 [2019-03-28 12:37:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:40,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:40,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:40,976 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 67.97/34.40 [2019-03-28 12:37:40,977 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,987 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:40,988 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:40,988 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 67.97/34.40 [2019-03-28 12:37:40,994 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 67.97/34.40 [2019-03-28 12:37:40,995 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:41,003 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:41,004 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:41,004 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 67.97/34.40 [2019-03-28 12:37:41,010 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.40 [2019-03-28 12:37:41,011 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:41,019 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:41,019 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:41,019 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 67.97/34.40 [2019-03-28 12:37:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:41,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:41,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:41,040 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.40 [2019-03-28 12:37:41,040 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:41,062 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:41,063 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:41,063 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 67.97/34.40 [2019-03-28 12:37:41,073 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 67.97/34.40 [2019-03-28 12:37:41,074 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:41,080 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:41,081 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:41,081 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 67.97/34.40 [2019-03-28 12:37:41,090 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.40 [2019-03-28 12:37:41,090 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:41,097 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:41,097 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:41,098 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 67.97/34.40 [2019-03-28 12:37:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:41,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:41,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:41,119 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.40 [2019-03-28 12:37:41,119 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:41,127 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:41,127 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:41,127 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 67.97/34.40 [2019-03-28 12:37:41,138 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 67.97/34.40 [2019-03-28 12:37:41,139 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:41,145 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:41,145 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:41,146 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 67.97/34.40 [2019-03-28 12:37:41,150 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.40 [2019-03-28 12:37:41,150 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:41,156 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:41,156 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:41,156 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 67.97/34.40 [2019-03-28 12:37:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:41,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:41,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:41,177 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 67.97/34.40 [2019-03-28 12:37:41,177 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:41,184 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:41,184 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:41,184 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 67.97/34.40 [2019-03-28 12:37:41,188 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.40 [2019-03-28 12:37:41,188 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:41,195 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:41,195 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:41,196 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 67.97/34.40 [2019-03-28 12:37:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:41,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:41,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:41,218 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 67.97/34.40 [2019-03-28 12:37:41,218 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:41,225 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:41,226 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:41,226 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 67.97/34.40 [2019-03-28 12:37:41,230 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.40 [2019-03-28 12:37:41,231 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:41,238 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:41,238 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:41,238 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 67.97/34.40 [2019-03-28 12:37:41,245 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 67.97/34.40 [2019-03-28 12:37:41,246 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:41,254 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:41,254 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:41,255 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 67.97/34.40 [2019-03-28 12:37:41,256 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 8 predicates after loop cannibalization 67.97/34.40 [2019-03-28 12:37:41,256 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 8 loop predicates 67.97/34.40 [2019-03-28 12:37:41,256 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 86 states and 108 transitions. cyclomatic complexity: 26 Second operand 8 states. 67.97/34.40 [2019-03-28 12:37:41,994 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 86 states and 108 transitions. cyclomatic complexity: 26. Second operand 8 states. Result 752 states and 866 transitions. Complement of second has 142 states. 67.97/34.40 [2019-03-28 12:37:41,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 4 stem states 17 non-accepting loop states 2 accepting loop states 67.97/34.40 [2019-03-28 12:37:41,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 67.97/34.40 [2019-03-28 12:37:41,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 166 transitions. 67.97/34.40 [2019-03-28 12:37:41,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 166 transitions. Stem has 4 letters. Loop has 23 letters. 67.97/34.40 [2019-03-28 12:37:41,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.97/34.40 [2019-03-28 12:37:41,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 166 transitions. Stem has 27 letters. Loop has 23 letters. 67.97/34.40 [2019-03-28 12:37:41,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.97/34.40 [2019-03-28 12:37:41,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 166 transitions. Stem has 4 letters. Loop has 46 letters. 67.97/34.40 [2019-03-28 12:37:41,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.97/34.40 [2019-03-28 12:37:42,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 752 states and 866 transitions. 67.97/34.40 [2019-03-28 12:37:42,006 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 114 67.97/34.40 [2019-03-28 12:37:42,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 752 states to 288 states and 339 transitions. 67.97/34.40 [2019-03-28 12:37:42,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 67.97/34.40 [2019-03-28 12:37:42,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 67.97/34.40 [2019-03-28 12:37:42,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 288 states and 339 transitions. 67.97/34.40 [2019-03-28 12:37:42,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 67.97/34.40 [2019-03-28 12:37:42,009 INFO L706 BuchiCegarLoop]: Abstraction has 288 states and 339 transitions. 67.97/34.40 [2019-03-28 12:37:42,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states and 339 transitions. 67.97/34.40 [2019-03-28 12:37:42,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 86. 67.97/34.40 [2019-03-28 12:37:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. 67.97/34.40 [2019-03-28 12:37:42,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. 67.97/34.40 [2019-03-28 12:37:42,013 INFO L729 BuchiCegarLoop]: Abstraction has 86 states and 107 transitions. 67.97/34.40 [2019-03-28 12:37:42,013 INFO L609 BuchiCegarLoop]: Abstraction has 86 states and 107 transitions. 67.97/34.40 [2019-03-28 12:37:42,013 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ 67.97/34.40 [2019-03-28 12:37:42,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 107 transitions. 67.97/34.40 [2019-03-28 12:37:42,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 67.97/34.40 [2019-03-28 12:37:42,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 67.97/34.40 [2019-03-28 12:37:42,014 INFO L119 BuchiIsEmpty]: Starting construction of run 67.97/34.40 [2019-03-28 12:37:42,014 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 67.97/34.40 [2019-03-28 12:37:42,014 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] 67.97/34.40 [2019-03-28 12:37:42,015 INFO L794 eck$LassoCheckResult]: Stem: 8340#ULTIMATE.startENTRY [120] 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] 8330#L-1 [185] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 8331#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 8352#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 8313#L8-2 67.97/34.40 [2019-03-28 12:37:42,015 INFO L796 eck$LassoCheckResult]: Loop: 8313#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 8309#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 8310#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 8341#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 8326#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 8321#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 8322#L10 [205] L10-->L11: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet6_3|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_3|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 8335#L11 [122] L11-->L11-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_4|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_4|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 8333#L11-1 [253] L11-1-->L12: Formula: (and (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_25 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_25) v_ULTIMATE.start_main_~x~0.offset_18 (+ |v_ULTIMATE.start_main_#t~mem7_6| (- 1))))) (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~x~0.base_25)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_18 4) (select |v_#length_31| v_ULTIMATE.start_main_~x~0.base_25)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_18)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_31|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_31|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 8334#L12 [256] L12-->L17-2: Formula: (and (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~y~0.base_24 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~y~0.base_24) v_ULTIMATE.start_main_~y~0.offset_18 |v_ULTIMATE.start_main_#t~nondet8_5|)) |v_#memory_int_28|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_18 4) (select |v_#length_34| v_ULTIMATE.start_main_~y~0.base_24)) (= 1 (select |v_#valid_45| v_ULTIMATE.start_main_~y~0.base_24)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_18)) InVars {#valid=|v_#valid_45|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_24, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_18, #length=|v_#length_34|} OutVars{#valid=|v_#valid_45|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_24, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_18, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8, #memory_int] 8304#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 8305#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 8319#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 8311#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 8312#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 8342#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 8327#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 8328#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 8336#L10 [99] L10-->L14: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet6_5|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_5|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 8337#L14 [108] L14-->L14-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~y~0.base_10)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8) |v_ULTIMATE.start_main_#t~mem9_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_16| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 8343#L14-1 [252] L14-1-->L17-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1)))) |v_#memory_int_20|) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_22)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_30| v_ULTIMATE.start_main_~y~0.base_22))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 8306#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 8308#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 8313#L8-2 67.97/34.40 [2019-03-28 12:37:42,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.40 [2019-03-28 12:37:42,016 INFO L82 PathProgramCache]: Analyzing trace with hash 4680945, now seen corresponding path program 1 times 67.97/34.40 [2019-03-28 12:37:42,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.97/34.40 [2019-03-28 12:37:42,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.97/34.40 [2019-03-28 12:37:42,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:42,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:42,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:42,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.40 [2019-03-28 12:37:42,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1761686308, now seen corresponding path program 2 times 67.97/34.40 [2019-03-28 12:37:42,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.97/34.40 [2019-03-28 12:37:42,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.97/34.40 [2019-03-28 12:37:42,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:42,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:42,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:42,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.40 [2019-03-28 12:37:42,040 INFO L82 PathProgramCache]: Analyzing trace with hash -225036236, now seen corresponding path program 1 times 67.97/34.40 [2019-03-28 12:37:42,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.97/34.40 [2019-03-28 12:37:42,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.97/34.40 [2019-03-28 12:37:42,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:42,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:42,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:42,311 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 67.97/34.40 [2019-03-28 12:37:42,488 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 67.97/34.40 [2019-03-28 12:37:42,535 INFO L216 LassoAnalysis]: Preferences: 67.97/34.40 [2019-03-28 12:37:42,535 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 67.97/34.40 [2019-03-28 12:37:42,535 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 67.97/34.40 [2019-03-28 12:37:42,535 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 67.97/34.40 [2019-03-28 12:37:42,535 INFO L127 ssoRankerPreferences]: Use exernal solver: false 67.97/34.40 [2019-03-28 12:37:42,535 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 67.97/34.40 [2019-03-28 12:37:42,536 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 67.97/34.40 [2019-03-28 12:37:42,536 INFO L130 ssoRankerPreferences]: Path of dumped script: 67.97/34.40 [2019-03-28 12:37:42,536 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration15_Lasso 67.97/34.40 [2019-03-28 12:37:42,536 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 67.97/34.40 [2019-03-28 12:37:42,536 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 67.97/34.40 [2019-03-28 12:37:42,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:42,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:42,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:42,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:42,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:42,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:42,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:42,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:42,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:42,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:42,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:42,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:42,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:42,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:42,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:42,984 INFO L300 LassoAnalysis]: Preprocessing complete. 67.97/34.40 [2019-03-28 12:37:42,985 INFO L497 LassoAnalysis]: Using template 'affine'. 67.97/34.40 [2019-03-28 12:37:42,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:42,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:42,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.40 [2019-03-28 12:37:42,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:42,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:42,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:42,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:42,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:42,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:42,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:42,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:42,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:42,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:42,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:42,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:42,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:42,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:42,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:42,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:42,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.40 [2019-03-28 12:37:42,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:42,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:42,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:42,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:42,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:42,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:42,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:42,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:42,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.40 [2019-03-28 12:37:42,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:42,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:42,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:42,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:42,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:42,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:42,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:42,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:42,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:42,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:42,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:42,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:42,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:42,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:42,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:43,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:43,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:43,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:43,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:43,001 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:43,001 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:43,008 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 67.97/34.40 [2019-03-28 12:37:43,011 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 67.97/34.40 [2019-03-28 12:37:43,011 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. 67.97/34.40 [2019-03-28 12:37:43,012 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 67.97/34.40 [2019-03-28 12:37:43,012 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 67.97/34.40 [2019-03-28 12:37:43,013 INFO L518 LassoAnalysis]: Proved termination. 67.97/34.40 [2019-03-28 12:37:43,013 INFO L520 LassoAnalysis]: Termination argument consisting of: 67.97/34.40 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_9) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_9 67.97/34.40 Supporting invariants [] 67.97/34.40 [2019-03-28 12:37:43,040 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed 67.97/34.40 [2019-03-28 12:37:43,042 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.97/34.40 [2019-03-28 12:37:43,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.40 [2019-03-28 12:37:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:43,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:43,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:43,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:43,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:43,152 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 67.97/34.40 [2019-03-28 12:37:43,152 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,161 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:43,161 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,161 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 67.97/34.40 [2019-03-28 12:37:43,186 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.40 [2019-03-28 12:37:43,187 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,197 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:43,197 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,197 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 67.97/34.40 [2019-03-28 12:37:43,205 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 67.97/34.40 [2019-03-28 12:37:43,206 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,215 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:43,216 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,216 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 67.97/34.40 [2019-03-28 12:37:43,217 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 67.97/34.40 [2019-03-28 12:37:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:43,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:43,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:43,361 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 67.97/34.40 [2019-03-28 12:37:43,361 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,370 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:43,370 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,370 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 67.97/34.40 [2019-03-28 12:37:43,375 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.40 [2019-03-28 12:37:43,375 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,385 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:43,385 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,386 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 67.97/34.40 [2019-03-28 12:37:43,392 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 67.97/34.40 [2019-03-28 12:37:43,393 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,401 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:43,402 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,402 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 67.97/34.40 [2019-03-28 12:37:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:43,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:43,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:43,446 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 67.97/34.40 [2019-03-28 12:37:43,446 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,453 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:43,453 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,453 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 67.97/34.40 [2019-03-28 12:37:43,478 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.40 [2019-03-28 12:37:43,478 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,485 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:43,485 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,485 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:14 67.97/34.40 [2019-03-28 12:37:43,491 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 67.97/34.40 [2019-03-28 12:37:43,491 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,498 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:43,499 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,499 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 67.97/34.40 [2019-03-28 12:37:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:43,579 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 67.97/34.40 [2019-03-28 12:37:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:43,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:43,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:43,598 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 67.97/34.40 [2019-03-28 12:37:43,599 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,606 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:43,607 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,607 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:12 67.97/34.40 [2019-03-28 12:37:43,619 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.40 [2019-03-28 12:37:43,619 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,626 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:43,626 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,626 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 67.97/34.40 [2019-03-28 12:37:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:43,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:43,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:43,683 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 67.97/34.40 [2019-03-28 12:37:43,684 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,692 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:43,693 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,693 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 67.97/34.40 [2019-03-28 12:37:43,700 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 67.97/34.40 [2019-03-28 12:37:43,700 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,708 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:43,708 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,709 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 67.97/34.40 [2019-03-28 12:37:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:43,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:43,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:43,730 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 67.97/34.40 [2019-03-28 12:37:43,730 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,738 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:43,739 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,739 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 67.97/34.40 [2019-03-28 12:37:43,745 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 67.97/34.40 [2019-03-28 12:37:43,745 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,753 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:43,753 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,753 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 67.97/34.40 [2019-03-28 12:37:43,758 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.40 [2019-03-28 12:37:43,759 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,767 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:43,768 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,768 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 67.97/34.40 [2019-03-28 12:37:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:43,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:43,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:43,790 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 67.97/34.40 [2019-03-28 12:37:43,790 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,798 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:43,799 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,799 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 67.97/34.40 [2019-03-28 12:37:43,841 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 67.97/34.40 [2019-03-28 12:37:43,842 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,850 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:43,851 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,851 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 67.97/34.40 [2019-03-28 12:37:43,856 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.40 [2019-03-28 12:37:43,857 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,865 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:43,866 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,866 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 67.97/34.40 [2019-03-28 12:37:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:43,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:43,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:43,891 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.40 [2019-03-28 12:37:43,891 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,899 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:43,899 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,899 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 67.97/34.40 [2019-03-28 12:37:43,910 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 67.97/34.40 [2019-03-28 12:37:43,911 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,919 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:43,920 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,920 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 67.97/34.40 [2019-03-28 12:37:43,924 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.40 [2019-03-28 12:37:43,925 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,932 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:43,932 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,932 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 67.97/34.40 [2019-03-28 12:37:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:43,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:43,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:43,958 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.40 [2019-03-28 12:37:43,958 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,966 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:43,966 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,966 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 67.97/34.40 [2019-03-28 12:37:43,979 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 67.97/34.40 [2019-03-28 12:37:43,980 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,986 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:43,987 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:43,987 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 67.97/34.40 [2019-03-28 12:37:43,993 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.40 [2019-03-28 12:37:43,993 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:44,000 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:44,001 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:44,001 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 67.97/34.40 [2019-03-28 12:37:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:44,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:44,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:44,027 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 67.97/34.40 [2019-03-28 12:37:44,028 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:44,037 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:44,037 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:44,038 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 67.97/34.40 [2019-03-28 12:37:44,042 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.40 [2019-03-28 12:37:44,043 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:44,051 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:44,052 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:44,052 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 67.97/34.40 [2019-03-28 12:37:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.40 [2019-03-28 12:37:44,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.40 [2019-03-28 12:37:44,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.40 [2019-03-28 12:37:44,080 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 67.97/34.40 [2019-03-28 12:37:44,080 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:44,089 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:44,089 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:44,090 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 67.97/34.40 [2019-03-28 12:37:44,100 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.40 [2019-03-28 12:37:44,100 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:44,112 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:44,112 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:44,113 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 67.97/34.40 [2019-03-28 12:37:44,119 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 67.97/34.40 [2019-03-28 12:37:44,119 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:44,129 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.40 [2019-03-28 12:37:44,130 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.40 [2019-03-28 12:37:44,130 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 67.97/34.40 [2019-03-28 12:37:44,131 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 8 predicates after loop cannibalization 67.97/34.40 [2019-03-28 12:37:44,131 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 8 loop predicates 67.97/34.40 [2019-03-28 12:37:44,132 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 86 states and 107 transitions. cyclomatic complexity: 25 Second operand 8 states. 67.97/34.40 [2019-03-28 12:37:44,785 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 86 states and 107 transitions. cyclomatic complexity: 25. Second operand 8 states. Result 551 states and 635 transitions. Complement of second has 105 states. 67.97/34.40 [2019-03-28 12:37:44,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 4 stem states 17 non-accepting loop states 2 accepting loop states 67.97/34.40 [2019-03-28 12:37:44,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 67.97/34.40 [2019-03-28 12:37:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 138 transitions. 67.97/34.40 [2019-03-28 12:37:44,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 138 transitions. Stem has 4 letters. Loop has 23 letters. 67.97/34.40 [2019-03-28 12:37:44,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.97/34.40 [2019-03-28 12:37:44,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 138 transitions. Stem has 27 letters. Loop has 23 letters. 67.97/34.40 [2019-03-28 12:37:44,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.97/34.40 [2019-03-28 12:37:44,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 138 transitions. Stem has 4 letters. Loop has 46 letters. 67.97/34.40 [2019-03-28 12:37:44,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.97/34.40 [2019-03-28 12:37:44,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 551 states and 635 transitions. 67.97/34.40 [2019-03-28 12:37:44,796 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 67.97/34.40 [2019-03-28 12:37:44,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 551 states to 196 states and 230 transitions. 67.97/34.40 [2019-03-28 12:37:44,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 67.97/34.40 [2019-03-28 12:37:44,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 67.97/34.40 [2019-03-28 12:37:44,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 230 transitions. 67.97/34.40 [2019-03-28 12:37:44,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 67.97/34.40 [2019-03-28 12:37:44,798 INFO L706 BuchiCegarLoop]: Abstraction has 196 states and 230 transitions. 67.97/34.40 [2019-03-28 12:37:44,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 230 transitions. 67.97/34.40 [2019-03-28 12:37:44,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 86. 67.97/34.40 [2019-03-28 12:37:44,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. 67.97/34.40 [2019-03-28 12:37:44,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 106 transitions. 67.97/34.40 [2019-03-28 12:37:44,801 INFO L729 BuchiCegarLoop]: Abstraction has 86 states and 106 transitions. 67.97/34.40 [2019-03-28 12:37:44,801 INFO L609 BuchiCegarLoop]: Abstraction has 86 states and 106 transitions. 67.97/34.40 [2019-03-28 12:37:44,801 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ 67.97/34.40 [2019-03-28 12:37:44,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 106 transitions. 67.97/34.40 [2019-03-28 12:37:44,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 67.97/34.40 [2019-03-28 12:37:44,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 67.97/34.40 [2019-03-28 12:37:44,802 INFO L119 BuchiIsEmpty]: Starting construction of run 67.97/34.40 [2019-03-28 12:37:44,802 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 67.97/34.40 [2019-03-28 12:37:44,802 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] 67.97/34.40 [2019-03-28 12:37:44,803 INFO L794 eck$LassoCheckResult]: Stem: 9940#ULTIMATE.startENTRY [120] 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] 9930#L-1 [184] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 9931#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 9953#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 9913#L8-2 67.97/34.40 [2019-03-28 12:37:44,803 INFO L796 eck$LassoCheckResult]: Loop: 9913#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 9909#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 9910#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 9941#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 9926#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 9921#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 9922#L10 [205] L10-->L11: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet6_3|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_3|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 9933#L11 [122] L11-->L11-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_4|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_4|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 9936#L11-1 [253] L11-1-->L12: Formula: (and (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_25 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_25) v_ULTIMATE.start_main_~x~0.offset_18 (+ |v_ULTIMATE.start_main_#t~mem7_6| (- 1))))) (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~x~0.base_25)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_18 4) (select |v_#length_31| v_ULTIMATE.start_main_~x~0.base_25)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_18)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_31|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_31|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 9937#L12 [256] L12-->L17-2: Formula: (and (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~y~0.base_24 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~y~0.base_24) v_ULTIMATE.start_main_~y~0.offset_18 |v_ULTIMATE.start_main_#t~nondet8_5|)) |v_#memory_int_28|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_18 4) (select |v_#length_34| v_ULTIMATE.start_main_~y~0.base_24)) (= 1 (select |v_#valid_45| v_ULTIMATE.start_main_~y~0.base_24)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_18)) InVars {#valid=|v_#valid_45|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_24, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_18, #length=|v_#length_34|} OutVars{#valid=|v_#valid_45|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_24, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_18, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8, #memory_int] 9904#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 9905#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 9919#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 9911#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 9912#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 9942#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 9943#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 9977#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 9934#L10 [99] L10-->L14: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet6_5|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_5|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 9935#L14 [108] L14-->L14-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~y~0.base_10)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8) |v_ULTIMATE.start_main_#t~mem9_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_16| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 9944#L14-1 [252] L14-1-->L17-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1)))) |v_#memory_int_20|) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_22)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_30| v_ULTIMATE.start_main_~y~0.base_22))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 9906#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 9908#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 9913#L8-2 67.97/34.40 [2019-03-28 12:37:44,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.40 [2019-03-28 12:37:44,804 INFO L82 PathProgramCache]: Analyzing trace with hash 4679984, now seen corresponding path program 1 times 67.97/34.40 [2019-03-28 12:37:44,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.97/34.40 [2019-03-28 12:37:44,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.97/34.40 [2019-03-28 12:37:44,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:44,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:44,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:44,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.40 [2019-03-28 12:37:44,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1761686308, now seen corresponding path program 3 times 67.97/34.40 [2019-03-28 12:37:44,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.97/34.40 [2019-03-28 12:37:44,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.97/34.40 [2019-03-28 12:37:44,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:44,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:44,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:44,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.40 [2019-03-28 12:37:44,825 INFO L82 PathProgramCache]: Analyzing trace with hash -256056043, now seen corresponding path program 1 times 67.97/34.40 [2019-03-28 12:37:44,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.97/34.40 [2019-03-28 12:37:44,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.97/34.40 [2019-03-28 12:37:44,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:44,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:44,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.97/34.40 [2019-03-28 12:37:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.40 [2019-03-28 12:37:45,158 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 67.97/34.40 [2019-03-28 12:37:45,329 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 67.97/34.40 [2019-03-28 12:37:45,383 INFO L216 LassoAnalysis]: Preferences: 67.97/34.40 [2019-03-28 12:37:45,383 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 67.97/34.40 [2019-03-28 12:37:45,383 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 67.97/34.40 [2019-03-28 12:37:45,383 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 67.97/34.40 [2019-03-28 12:37:45,384 INFO L127 ssoRankerPreferences]: Use exernal solver: false 67.97/34.40 [2019-03-28 12:37:45,384 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 67.97/34.40 [2019-03-28 12:37:45,384 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 67.97/34.40 [2019-03-28 12:37:45,384 INFO L130 ssoRankerPreferences]: Path of dumped script: 67.97/34.40 [2019-03-28 12:37:45,384 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration16_Lasso 67.97/34.40 [2019-03-28 12:37:45,384 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 67.97/34.40 [2019-03-28 12:37:45,384 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 67.97/34.40 [2019-03-28 12:37:45,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:45,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:45,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:45,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:45,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:45,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:45,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:45,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:45,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:45,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:45,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:45,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:45,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:45,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.97/34.40 [2019-03-28 12:37:45,840 INFO L300 LassoAnalysis]: Preprocessing complete. 67.97/34.40 [2019-03-28 12:37:45,840 INFO L497 LassoAnalysis]: Using template 'affine'. 67.97/34.40 [2019-03-28 12:37:45,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:45,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:45,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.40 [2019-03-28 12:37:45,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:45,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:45,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:45,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:45,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:45,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:45,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:45,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:45,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:45,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:45,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:45,844 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:45,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:45,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:45,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:45,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.40 [2019-03-28 12:37:45,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.40 [2019-03-28 12:37:45,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.40 [2019-03-28 12:37:45,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.40 [2019-03-28 12:37:45,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.40 [2019-03-28 12:37:45,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.40 [2019-03-28 12:37:45,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.40 [2019-03-28 12:37:45,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.40 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.40 Number of strict supporting invariants: 0 67.97/34.40 Number of non-strict supporting invariants: 1 67.97/34.40 Consider only non-deceasing supporting invariants: true 67.97/34.40 Simplify termination arguments: true 67.97/34.40 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.40 [2019-03-28 12:37:45,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.41 [2019-03-28 12:37:45,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.41 [2019-03-28 12:37:45,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.41 [2019-03-28 12:37:45,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.41 [2019-03-28 12:37:45,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.41 [2019-03-28 12:37:45,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.41 [2019-03-28 12:37:45,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.41 [2019-03-28 12:37:45,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.41 [2019-03-28 12:37:45,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.41 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.41 Number of strict supporting invariants: 0 67.97/34.41 Number of non-strict supporting invariants: 1 67.97/34.41 Consider only non-deceasing supporting invariants: true 67.97/34.41 Simplify termination arguments: true 67.97/34.41 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.41 [2019-03-28 12:37:45,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.41 [2019-03-28 12:37:45,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.41 [2019-03-28 12:37:45,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.41 [2019-03-28 12:37:45,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.41 [2019-03-28 12:37:45,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.41 [2019-03-28 12:37:45,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.41 [2019-03-28 12:37:45,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.41 [2019-03-28 12:37:45,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.41 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.41 Number of strict supporting invariants: 0 67.97/34.41 Number of non-strict supporting invariants: 1 67.97/34.41 Consider only non-deceasing supporting invariants: true 67.97/34.41 Simplify termination arguments: true 67.97/34.41 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.41 [2019-03-28 12:37:45,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.41 [2019-03-28 12:37:45,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.41 [2019-03-28 12:37:45,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.41 [2019-03-28 12:37:45,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.41 [2019-03-28 12:37:45,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.41 [2019-03-28 12:37:45,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.41 [2019-03-28 12:37:45,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.41 [2019-03-28 12:37:45,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.41 [2019-03-28 12:37:45,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.41 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.41 Number of strict supporting invariants: 0 67.97/34.41 Number of non-strict supporting invariants: 1 67.97/34.41 Consider only non-deceasing supporting invariants: true 67.97/34.41 Simplify termination arguments: true 67.97/34.41 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.41 [2019-03-28 12:37:45,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.41 [2019-03-28 12:37:45,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.41 [2019-03-28 12:37:45,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.41 [2019-03-28 12:37:45,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.41 [2019-03-28 12:37:45,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.41 [2019-03-28 12:37:45,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.41 [2019-03-28 12:37:45,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.41 [2019-03-28 12:37:45,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.41 [2019-03-28 12:37:45,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.41 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.41 Number of strict supporting invariants: 0 67.97/34.41 Number of non-strict supporting invariants: 1 67.97/34.41 Consider only non-deceasing supporting invariants: true 67.97/34.41 Simplify termination arguments: true 67.97/34.41 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.41 [2019-03-28 12:37:45,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.41 [2019-03-28 12:37:45,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.41 [2019-03-28 12:37:45,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.41 [2019-03-28 12:37:45,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.41 [2019-03-28 12:37:45,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.41 [2019-03-28 12:37:45,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.41 [2019-03-28 12:37:45,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.41 [2019-03-28 12:37:45,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.41 [2019-03-28 12:37:45,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.41 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.41 Number of strict supporting invariants: 0 67.97/34.41 Number of non-strict supporting invariants: 1 67.97/34.41 Consider only non-deceasing supporting invariants: true 67.97/34.41 Simplify termination arguments: true 67.97/34.41 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.41 [2019-03-28 12:37:45,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.41 [2019-03-28 12:37:45,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.41 [2019-03-28 12:37:45,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.41 [2019-03-28 12:37:45,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.41 [2019-03-28 12:37:45,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.41 [2019-03-28 12:37:45,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.41 [2019-03-28 12:37:45,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.41 [2019-03-28 12:37:45,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.41 [2019-03-28 12:37:45,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.41 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.41 Number of strict supporting invariants: 0 67.97/34.41 Number of non-strict supporting invariants: 1 67.97/34.41 Consider only non-deceasing supporting invariants: true 67.97/34.41 Simplify termination arguments: true 67.97/34.41 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.41 [2019-03-28 12:37:45,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.41 [2019-03-28 12:37:45,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.41 [2019-03-28 12:37:45,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.41 [2019-03-28 12:37:45,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.41 [2019-03-28 12:37:45,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.41 [2019-03-28 12:37:45,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.41 [2019-03-28 12:37:45,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.41 [2019-03-28 12:37:45,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.41 [2019-03-28 12:37:45,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.41 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.41 Number of strict supporting invariants: 0 67.97/34.41 Number of non-strict supporting invariants: 1 67.97/34.41 Consider only non-deceasing supporting invariants: true 67.97/34.41 Simplify termination arguments: true 67.97/34.41 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.41 [2019-03-28 12:37:45,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.41 [2019-03-28 12:37:45,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.41 [2019-03-28 12:37:45,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.41 [2019-03-28 12:37:45,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.41 [2019-03-28 12:37:45,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.41 [2019-03-28 12:37:45,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.41 [2019-03-28 12:37:45,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.41 [2019-03-28 12:37:45,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.41 [2019-03-28 12:37:45,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.41 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.41 Number of strict supporting invariants: 0 67.97/34.41 Number of non-strict supporting invariants: 1 67.97/34.41 Consider only non-deceasing supporting invariants: true 67.97/34.41 Simplify termination arguments: true 67.97/34.41 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.41 [2019-03-28 12:37:45,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.41 [2019-03-28 12:37:45,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.41 [2019-03-28 12:37:45,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.41 [2019-03-28 12:37:45,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.41 [2019-03-28 12:37:45,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.41 [2019-03-28 12:37:45,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.41 [2019-03-28 12:37:45,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.41 [2019-03-28 12:37:45,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.41 [2019-03-28 12:37:45,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.41 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.41 Number of strict supporting invariants: 0 67.97/34.41 Number of non-strict supporting invariants: 1 67.97/34.41 Consider only non-deceasing supporting invariants: true 67.97/34.41 Simplify termination arguments: true 67.97/34.41 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.41 [2019-03-28 12:37:45,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.41 [2019-03-28 12:37:45,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.41 [2019-03-28 12:37:45,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.41 [2019-03-28 12:37:45,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.41 [2019-03-28 12:37:45,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.41 [2019-03-28 12:37:45,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.41 [2019-03-28 12:37:45,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.41 [2019-03-28 12:37:45,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.41 [2019-03-28 12:37:45,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.41 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.41 Number of strict supporting invariants: 0 67.97/34.41 Number of non-strict supporting invariants: 1 67.97/34.41 Consider only non-deceasing supporting invariants: true 67.97/34.41 Simplify termination arguments: true 67.97/34.41 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.41 [2019-03-28 12:37:45,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.41 [2019-03-28 12:37:45,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.97/34.41 [2019-03-28 12:37:45,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.41 [2019-03-28 12:37:45,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.41 [2019-03-28 12:37:45,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.41 [2019-03-28 12:37:45,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.97/34.41 [2019-03-28 12:37:45,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.97/34.41 [2019-03-28 12:37:45,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.41 [2019-03-28 12:37:45,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.41 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.41 Number of strict supporting invariants: 0 67.97/34.41 Number of non-strict supporting invariants: 1 67.97/34.41 Consider only non-deceasing supporting invariants: true 67.97/34.41 Simplify termination arguments: true 67.97/34.41 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.41 [2019-03-28 12:37:45,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.41 [2019-03-28 12:37:45,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.41 [2019-03-28 12:37:45,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.41 [2019-03-28 12:37:45,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.41 [2019-03-28 12:37:45,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.41 [2019-03-28 12:37:45,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.41 [2019-03-28 12:37:45,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.41 [2019-03-28 12:37:45,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.41 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.41 Number of strict supporting invariants: 0 67.97/34.41 Number of non-strict supporting invariants: 1 67.97/34.41 Consider only non-deceasing supporting invariants: true 67.97/34.41 Simplify termination arguments: true 67.97/34.41 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.41 [2019-03-28 12:37:45,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.41 [2019-03-28 12:37:45,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.41 [2019-03-28 12:37:45,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.41 [2019-03-28 12:37:45,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.41 [2019-03-28 12:37:45,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.41 [2019-03-28 12:37:45,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.41 [2019-03-28 12:37:45,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.97/34.41 [2019-03-28 12:37:45,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.97/34.41 Termination analysis: LINEAR_WITH_GUESSES 67.97/34.41 Number of strict supporting invariants: 0 67.97/34.41 Number of non-strict supporting invariants: 1 67.97/34.41 Consider only non-deceasing supporting invariants: true 67.97/34.41 Simplify termination arguments: true 67.97/34.41 Simplify supporting invariants: trueOverapproximate stem: false 67.97/34.41 [2019-03-28 12:37:45,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.97/34.41 [2019-03-28 12:37:45,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.97/34.41 [2019-03-28 12:37:45,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.97/34.41 [2019-03-28 12:37:45,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.97/34.41 [2019-03-28 12:37:45,883 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.97/34.41 [2019-03-28 12:37:45,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.97/34.41 [2019-03-28 12:37:45,890 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 67.97/34.41 [2019-03-28 12:37:45,895 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 67.97/34.41 [2019-03-28 12:37:45,895 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. 67.97/34.41 [2019-03-28 12:37:45,896 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 67.97/34.41 [2019-03-28 12:37:45,897 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. 67.97/34.41 [2019-03-28 12:37:45,897 INFO L518 LassoAnalysis]: Proved termination. 67.97/34.41 [2019-03-28 12:37:45,897 INFO L520 LassoAnalysis]: Termination argument consisting of: 67.97/34.41 Ranking function f(ULTIMATE.start_main_#t~mem2) = 1*ULTIMATE.start_main_#t~mem2 67.97/34.41 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_10 + 1*ULTIMATE.start_main_#t~mem2 >= 0, 2*ULTIMATE.start_main_#t~mem2 - 1 >= 0] 67.97/34.41 [2019-03-28 12:37:45,931 INFO L297 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed 67.97/34.41 [2019-03-28 12:37:45,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.97/34.41 [2019-03-28 12:37:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.41 [2019-03-28 12:37:45,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core 67.97/34.41 [2019-03-28 12:37:45,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.41 [2019-03-28 12:37:45,983 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 67.97/34.41 [2019-03-28 12:37:45,984 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:45,988 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.41 [2019-03-28 12:37:45,988 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:45,988 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 67.97/34.41 [2019-03-28 12:37:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.41 [2019-03-28 12:37:46,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjunts are in the unsatisfiable core 67.97/34.41 [2019-03-28 12:37:46,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.41 [2019-03-28 12:37:46,088 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 67.97/34.41 [2019-03-28 12:37:46,089 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,097 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.41 [2019-03-28 12:37:46,098 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,098 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 67.97/34.41 [2019-03-28 12:37:46,125 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.41 [2019-03-28 12:37:46,126 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,133 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.41 [2019-03-28 12:37:46,134 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,134 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 67.97/34.41 [2019-03-28 12:37:46,140 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 67.97/34.41 [2019-03-28 12:37:46,140 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,148 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.41 [2019-03-28 12:37:46,148 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,148 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 67.97/34.41 [2019-03-28 12:37:46,171 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 67.97/34.41 [2019-03-28 12:37:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.41 [2019-03-28 12:37:46,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjunts are in the unsatisfiable core 67.97/34.41 [2019-03-28 12:37:46,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.41 [2019-03-28 12:37:46,355 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 67.97/34.41 [2019-03-28 12:37:46,355 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,364 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.41 [2019-03-28 12:37:46,364 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,365 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 67.97/34.41 [2019-03-28 12:37:46,369 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.41 [2019-03-28 12:37:46,370 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,378 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.41 [2019-03-28 12:37:46,379 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,379 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 67.97/34.41 [2019-03-28 12:37:46,386 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 67.97/34.41 [2019-03-28 12:37:46,386 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,395 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.41 [2019-03-28 12:37:46,396 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,396 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 67.97/34.41 [2019-03-28 12:37:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.41 [2019-03-28 12:37:46,417 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 67.97/34.41 [2019-03-28 12:37:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.41 [2019-03-28 12:37:46,436 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 67.97/34.41 [2019-03-28 12:37:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.41 [2019-03-28 12:37:46,454 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 67.97/34.41 [2019-03-28 12:37:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.41 [2019-03-28 12:37:46,473 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 67.97/34.41 [2019-03-28 12:37:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.41 [2019-03-28 12:37:46,491 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 67.97/34.41 [2019-03-28 12:37:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.41 [2019-03-28 12:37:46,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 11 conjunts are in the unsatisfiable core 67.97/34.41 [2019-03-28 12:37:46,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.41 [2019-03-28 12:37:46,555 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.41 [2019-03-28 12:37:46,556 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,565 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.41 [2019-03-28 12:37:46,566 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,566 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:15 67.97/34.41 [2019-03-28 12:37:46,605 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 67.97/34.41 [2019-03-28 12:37:46,605 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,614 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.41 [2019-03-28 12:37:46,614 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,614 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 67.97/34.41 [2019-03-28 12:37:46,619 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.41 [2019-03-28 12:37:46,620 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,628 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.41 [2019-03-28 12:37:46,629 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,629 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 67.97/34.41 [2019-03-28 12:37:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.41 [2019-03-28 12:37:46,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjunts are in the unsatisfiable core 67.97/34.41 [2019-03-28 12:37:46,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.41 [2019-03-28 12:37:46,655 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 67.97/34.41 [2019-03-28 12:37:46,656 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,663 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.41 [2019-03-28 12:37:46,664 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,664 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 67.97/34.41 [2019-03-28 12:37:46,669 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 67.97/34.41 [2019-03-28 12:37:46,669 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,676 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.41 [2019-03-28 12:37:46,677 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,677 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 67.97/34.41 [2019-03-28 12:37:46,681 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.41 [2019-03-28 12:37:46,682 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,689 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.41 [2019-03-28 12:37:46,689 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,689 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 67.97/34.41 [2019-03-28 12:37:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.41 [2019-03-28 12:37:46,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjunts are in the unsatisfiable core 67.97/34.41 [2019-03-28 12:37:46,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.41 [2019-03-28 12:37:46,710 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 67.97/34.41 [2019-03-28 12:37:46,710 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,723 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.41 [2019-03-28 12:37:46,723 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,723 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 67.97/34.41 [2019-03-28 12:37:46,729 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 67.97/34.41 [2019-03-28 12:37:46,730 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,738 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.41 [2019-03-28 12:37:46,739 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,739 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 67.97/34.41 [2019-03-28 12:37:46,744 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.41 [2019-03-28 12:37:46,744 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,752 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.41 [2019-03-28 12:37:46,753 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,753 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 67.97/34.41 [2019-03-28 12:37:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.41 [2019-03-28 12:37:46,768 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 67.97/34.41 [2019-03-28 12:37:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.41 [2019-03-28 12:37:46,783 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 67.97/34.41 [2019-03-28 12:37:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.41 [2019-03-28 12:37:46,796 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 67.97/34.41 [2019-03-28 12:37:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.97/34.41 [2019-03-28 12:37:46,810 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 67.97/34.41 [2019-03-28 12:37:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.97/34.41 [2019-03-28 12:37:46,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 11 conjunts are in the unsatisfiable core 67.97/34.41 [2019-03-28 12:37:46,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.97/34.41 [2019-03-28 12:37:46,829 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 67.97/34.41 [2019-03-28 12:37:46,829 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,837 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.41 [2019-03-28 12:37:46,837 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,837 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 67.97/34.41 [2019-03-28 12:37:46,844 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 67.97/34.41 [2019-03-28 12:37:46,845 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,852 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.41 [2019-03-28 12:37:46,853 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,853 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 67.97/34.41 [2019-03-28 12:37:46,859 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 67.97/34.41 [2019-03-28 12:37:46,859 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,867 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.97/34.41 [2019-03-28 12:37:46,867 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.97/34.41 [2019-03-28 12:37:46,867 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 67.97/34.41 [2019-03-28 12:37:46,868 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 10 predicates after loop cannibalization 67.97/34.41 [2019-03-28 12:37:46,869 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 67.97/34.41 [2019-03-28 12:37:46,869 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 86 states and 106 transitions. cyclomatic complexity: 24 Second operand 10 states. 67.97/34.41 [2019-03-28 12:37:47,258 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 86 states and 106 transitions. cyclomatic complexity: 24. Second operand 10 states. Result 180 states and 213 transitions. Complement of second has 34 states. 67.97/34.41 [2019-03-28 12:37:47,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 3 stem states 8 non-accepting loop states 2 accepting loop states 67.97/34.41 [2019-03-28 12:37:47,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 67.97/34.41 [2019-03-28 12:37:47,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. 67.97/34.41 [2019-03-28 12:37:47,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 54 transitions. Stem has 4 letters. Loop has 23 letters. 67.97/34.41 [2019-03-28 12:37:47,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.97/34.41 [2019-03-28 12:37:47,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 54 transitions. Stem has 27 letters. Loop has 23 letters. 67.97/34.41 [2019-03-28 12:37:47,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.97/34.41 [2019-03-28 12:37:47,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 54 transitions. Stem has 4 letters. Loop has 46 letters. 67.97/34.41 [2019-03-28 12:37:47,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.97/34.41 [2019-03-28 12:37:47,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 213 transitions. 67.97/34.41 [2019-03-28 12:37:47,267 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 67.97/34.41 [2019-03-28 12:37:47,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 0 states and 0 transitions. 67.97/34.41 [2019-03-28 12:37:47,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 67.97/34.41 [2019-03-28 12:37:47,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 67.97/34.41 [2019-03-28 12:37:47,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 67.97/34.41 [2019-03-28 12:37:47,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 67.97/34.41 [2019-03-28 12:37:47,268 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 67.97/34.41 [2019-03-28 12:37:47,268 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 67.97/34.41 [2019-03-28 12:37:47,268 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 67.97/34.41 [2019-03-28 12:37:47,268 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ 67.97/34.41 [2019-03-28 12:37:47,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 67.97/34.41 [2019-03-28 12:37:47,268 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 67.97/34.41 [2019-03-28 12:37:47,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 67.97/34.41 [2019-03-28 12:37:47,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:37:47 BasicIcfg 67.97/34.41 [2019-03-28 12:37:47,275 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 67.97/34.41 [2019-03-28 12:37:47,276 INFO L168 Benchmark]: Toolchain (without parser) took 27143.35 ms. Allocated memory was 649.6 MB in the beginning and 1.3 GB in the end (delta: 602.9 MB). Free memory was 563.9 MB in the beginning and 485.1 MB in the end (delta: 78.7 MB). Peak memory consumption was 681.7 MB. Max. memory is 50.3 GB. 67.97/34.41 [2019-03-28 12:37:47,276 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 67.97/34.41 [2019-03-28 12:37:47,277 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.95 ms. Allocated memory is still 649.6 MB. Free memory was 563.9 MB in the beginning and 616.9 MB in the end (delta: -53.0 MB). Peak memory consumption was 31.8 MB. Max. memory is 50.3 GB. 67.97/34.41 [2019-03-28 12:37:47,277 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.64 ms. Allocated memory is still 649.6 MB. Free memory was 616.9 MB in the beginning and 613.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 67.97/34.41 [2019-03-28 12:37:47,278 INFO L168 Benchmark]: Boogie Preprocessor took 25.27 ms. Allocated memory is still 649.6 MB. Free memory was 613.8 MB in the beginning and 612.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 67.97/34.41 [2019-03-28 12:37:47,278 INFO L168 Benchmark]: RCFGBuilder took 367.49 ms. Allocated memory is still 649.6 MB. Free memory was 612.5 MB in the beginning and 586.2 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 50.3 GB. 67.97/34.41 [2019-03-28 12:37:47,278 INFO L168 Benchmark]: BlockEncodingV2 took 158.43 ms. Allocated memory is still 649.6 MB. Free memory was 586.2 MB in the beginning and 574.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. 67.97/34.41 [2019-03-28 12:37:47,278 INFO L168 Benchmark]: TraceAbstraction took 1203.97 ms. Allocated memory is still 649.6 MB. Free memory was 574.1 MB in the beginning and 446.5 MB in the end (delta: 127.5 MB). Peak memory consumption was 127.5 MB. Max. memory is 50.3 GB. 67.97/34.41 [2019-03-28 12:37:47,279 INFO L168 Benchmark]: BuchiAutomizer took 25030.30 ms. Allocated memory was 649.6 MB in the beginning and 1.3 GB in the end (delta: 602.9 MB). Free memory was 445.2 MB in the beginning and 485.1 MB in the end (delta: -39.9 MB). Peak memory consumption was 563.0 MB. Max. memory is 50.3 GB. 67.97/34.41 [2019-03-28 12:37:47,281 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 67.97/34.41 --- Results --- 67.97/34.41 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 67.97/34.41 - StatisticsResult: Initial Icfg 67.97/34.41 58 locations, 63 edges 67.97/34.41 - StatisticsResult: Encoded RCFG 67.97/34.41 48 locations, 86 edges 67.97/34.41 * Results from de.uni_freiburg.informatik.ultimate.core: 67.97/34.41 - StatisticsResult: Toolchain Benchmarks 67.97/34.41 Benchmark results are: 67.97/34.41 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 67.97/34.41 * CACSL2BoogieTranslator took 309.95 ms. Allocated memory is still 649.6 MB. Free memory was 563.9 MB in the beginning and 616.9 MB in the end (delta: -53.0 MB). Peak memory consumption was 31.8 MB. Max. memory is 50.3 GB. 67.97/34.41 * Boogie Procedure Inliner took 42.64 ms. Allocated memory is still 649.6 MB. Free memory was 616.9 MB in the beginning and 613.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 67.97/34.41 * Boogie Preprocessor took 25.27 ms. Allocated memory is still 649.6 MB. Free memory was 613.8 MB in the beginning and 612.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 67.97/34.41 * RCFGBuilder took 367.49 ms. Allocated memory is still 649.6 MB. Free memory was 612.5 MB in the beginning and 586.2 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 50.3 GB. 67.97/34.41 * BlockEncodingV2 took 158.43 ms. Allocated memory is still 649.6 MB. Free memory was 586.2 MB in the beginning and 574.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. 67.97/34.41 * TraceAbstraction took 1203.97 ms. Allocated memory is still 649.6 MB. Free memory was 574.1 MB in the beginning and 446.5 MB in the end (delta: 127.5 MB). Peak memory consumption was 127.5 MB. Max. memory is 50.3 GB. 67.97/34.41 * BuchiAutomizer took 25030.30 ms. Allocated memory was 649.6 MB in the beginning and 1.3 GB in the end (delta: 602.9 MB). Free memory was 445.2 MB in the beginning and 485.1 MB in the end (delta: -39.9 MB). Peak memory consumption was 563.0 MB. Max. memory is 50.3 GB. 67.97/34.41 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 67.97/34.41 - GenericResult: Unfinished Backtranslation 67.97/34.41 unknown boogie variable #length 67.97/34.41 - GenericResult: Unfinished Backtranslation 67.97/34.41 unknown boogie variable #length 67.97/34.41 - GenericResult: Unfinished Backtranslation 67.97/34.41 unknown boogie variable #length 67.97/34.41 - GenericResult: Unfinished Backtranslation 67.97/34.41 unknown boogie variable #length 67.97/34.41 - GenericResult: Unfinished Backtranslation 67.97/34.41 unknown boogie variable #memory_int 67.97/34.41 - GenericResult: Unfinished Backtranslation 67.97/34.41 unknown boogie variable #memory_int 67.97/34.41 - GenericResult: Unfinished Backtranslation 67.97/34.41 unknown boogie variable #memory_int 67.97/34.41 - GenericResult: Unfinished Backtranslation 67.97/34.41 unknown boogie variable #memory_int 67.97/34.41 - GenericResult: Unfinished Backtranslation 67.97/34.41 unknown boogie variable #memory_int 67.97/34.41 - GenericResult: Unfinished Backtranslation 67.97/34.41 unknown boogie variable #memory_int 67.97/34.41 - GenericResult: Unfinished Backtranslation 67.97/34.41 unknown boogie variable #memory_int 67.97/34.41 - GenericResult: Unfinished Backtranslation 67.97/34.41 unknown boogie variable #memory_int 67.97/34.41 - GenericResult: Unfinished Backtranslation 67.97/34.41 unknown boogie variable #memory_int 67.97/34.41 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 67.97/34.41 - PositiveResult [Line: 18]: pointer dereference always succeeds 67.97/34.41 For all program executions holds that pointer dereference always succeeds at this location 67.97/34.41 - PositiveResult [Line: 18]: pointer dereference always succeeds 67.97/34.41 For all program executions holds that pointer dereference always succeeds at this location 67.97/34.41 - PositiveResult [Line: 14]: pointer dereference always succeeds 67.97/34.41 For all program executions holds that pointer dereference always succeeds at this location 67.97/34.41 - PositiveResult [Line: 14]: pointer dereference always succeeds 67.97/34.41 For all program executions holds that pointer dereference always succeeds at this location 67.97/34.41 - PositiveResult [Line: 14]: pointer dereference always succeeds 67.97/34.41 For all program executions holds that pointer dereference always succeeds at this location 67.97/34.41 - PositiveResult [Line: 8]: pointer dereference always succeeds 67.97/34.41 For all program executions holds that pointer dereference always succeeds at this location 67.97/34.41 - PositiveResult [Line: 20]: pointer dereference always succeeds 67.97/34.41 For all program executions holds that pointer dereference always succeeds at this location 67.97/34.41 - PositiveResult [Line: 20]: pointer dereference always succeeds 67.97/34.41 For all program executions holds that pointer dereference always succeeds at this location 67.97/34.41 - PositiveResult [Line: 8]: pointer dereference always succeeds 67.97/34.41 For all program executions holds that pointer dereference always succeeds at this location 67.97/34.41 - PositiveResult [Line: 20]: pointer dereference always succeeds 67.97/34.41 For all program executions holds that pointer dereference always succeeds at this location 67.97/34.41 - PositiveResult [Line: 20]: pointer dereference always succeeds 67.97/34.41 For all program executions holds that pointer dereference always succeeds at this location 67.97/34.41 - PositiveResult [Line: 18]: pointer dereference always succeeds 67.97/34.41 For all program executions holds that pointer dereference always succeeds at this location 67.97/34.41 - PositiveResult [Line: 18]: pointer dereference always succeeds 67.97/34.41 For all program executions holds that pointer dereference always succeeds at this location 67.97/34.41 - PositiveResult [Line: 11]: pointer dereference always succeeds 67.97/34.41 For all program executions holds that pointer dereference always succeeds at this location 67.97/34.41 - PositiveResult [Line: 11]: pointer dereference always succeeds 67.97/34.41 For all program executions holds that pointer dereference always succeeds at this location 67.97/34.41 - PositiveResult [Line: 9]: pointer dereference always succeeds 67.97/34.41 For all program executions holds that pointer dereference always succeeds at this location 67.97/34.41 - PositiveResult [Line: 9]: pointer dereference always succeeds 67.97/34.41 For all program executions holds that pointer dereference always succeeds at this location 67.97/34.41 - PositiveResult [Line: 21]: pointer dereference always succeeds 67.97/34.41 For all program executions holds that pointer dereference always succeeds at this location 67.97/34.41 - PositiveResult [Line: 21]: pointer dereference always succeeds 67.97/34.41 For all program executions holds that pointer dereference always succeeds at this location 67.97/34.41 - PositiveResult [Line: 8]: pointer dereference always succeeds 67.97/34.41 For all program executions holds that pointer dereference always succeeds at this location 67.97/34.41 - PositiveResult [Line: 8]: pointer dereference always succeeds 67.97/34.41 For all program executions holds that pointer dereference always succeeds at this location 67.97/34.41 - PositiveResult [Line: 14]: pointer dereference always succeeds 67.97/34.41 For all program executions holds that pointer dereference always succeeds at this location 67.97/34.41 - PositiveResult [Line: 12]: pointer dereference always succeeds 67.97/34.41 For all program executions holds that pointer dereference always succeeds at this location 67.97/34.41 - PositiveResult [Line: 12]: pointer dereference always succeeds 67.97/34.41 For all program executions holds that pointer dereference always succeeds at this location 67.97/34.41 - PositiveResult [Line: 11]: pointer dereference always succeeds 67.97/34.41 For all program executions holds that pointer dereference always succeeds at this location 67.97/34.41 - PositiveResult [Line: 11]: pointer dereference always succeeds 67.97/34.41 For all program executions holds that pointer dereference always succeeds at this location 67.97/34.41 - AllSpecificationsHoldResult: All specifications hold 67.97/34.41 26 specifications checked. All of them hold 67.97/34.41 - InvariantResult [Line: 8]: Loop Invariant 67.97/34.41 [2019-03-28 12:37:47,288 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.97/34.41 [2019-03-28 12:37:47,288 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.97/34.41 [2019-03-28 12:37:47,289 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.97/34.41 [2019-03-28 12:37:47,289 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.97/34.41 Derived loop invariant: ((((\valid[y] == 1 && unknown-#length-unknown[y] == 4) && \valid[x] == 1) && x == 0) && 4 == unknown-#length-unknown[x]) && y == 0 67.97/34.41 - StatisticsResult: Ultimate Automizer benchmark data 67.97/34.41 CFG has 1 procedures, 48 locations, 26 error locations. SAFE Result, 1.1s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 55 SDtfs, 276 SDslu, 4 SDs, 0 SdLazy, 262 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 27 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 395 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 67.97/34.41 - StatisticsResult: Constructed decomposition of program 67.97/34.41 Your program was decomposed into 16 terminating modules (6 trivial, 0 deterministic, 10 nondeterministic). One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 20 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 43 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 23 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 23 locations. One nondeterministic module has affine ranking function org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@68d75cd1 and consists of 13 locations. 6 modules have a trivial ranking function, the largest among these consists of 14 locations. 67.97/34.41 - StatisticsResult: Timing statistics 67.97/34.41 BüchiAutomizer plugin needed 25.0s and 17 iterations. TraceHistogramMax:3. Analysis of lassos took 9.8s. Construction of modules took 2.7s. Büchi inclusion checks took 12.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 13. Automata minimization 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 1036 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 208 states and ocurred in iteration 10. Nontrivial modules had stage [10, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 20/27 HoareTripleCheckerStatistics: 344 SDtfs, 1525 SDslu, 1331 SDs, 0 SdLazy, 3283 SolverSat, 284 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time LassoAnalysisResults: nont0 unkn0 SFLI6 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso10 LassoPreprocessingBenchmarks: Lassos: inital161 mio100 ax100 hnf100 lsp93 ukn79 mio100 lsp39 div100 bol100 ite100 ukn100 eq188 hnf88 smp99 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 67.97/34.41 - TerminationAnalysisResult: Termination proven 67.97/34.41 Buchi Automizer proved that your program is terminating 67.97/34.41 RESULT: Ultimate proved your program to be correct! 67.97/34.41 !SESSION 2019-03-28 12:37:14.635 ----------------------------------------------- 67.97/34.41 eclipse.buildId=unknown 67.97/34.41 java.version=1.8.0_181 67.97/34.41 java.vendor=Oracle Corporation 67.97/34.41 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 67.97/34.41 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 67.97/34.41 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 67.97/34.41 67.97/34.41 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:37:47.517 67.97/34.41 !MESSAGE The workspace will exit with unsaved changes in this session. 67.97/34.41 Received shutdown request... 67.97/34.41 Ultimate: 67.97/34.41 GTK+ Version Check 67.97/34.41 EOF