228.73/202.40 YES 228.73/202.40 228.73/202.40 Ultimate: Cannot open display: 228.73/202.40 This is Ultimate 0.1.24-8dc7c08-m 228.73/202.40 [2019-03-28 12:45:14,362 INFO L170 SettingsManager]: Resetting all preferences to default values... 228.73/202.40 [2019-03-28 12:45:14,364 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 228.73/202.40 [2019-03-28 12:45:14,376 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 228.73/202.40 [2019-03-28 12:45:14,376 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 228.73/202.40 [2019-03-28 12:45:14,377 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 228.73/202.40 [2019-03-28 12:45:14,379 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 228.73/202.40 [2019-03-28 12:45:14,380 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 228.73/202.40 [2019-03-28 12:45:14,382 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 228.73/202.41 [2019-03-28 12:45:14,382 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 228.73/202.41 [2019-03-28 12:45:14,383 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 228.73/202.41 [2019-03-28 12:45:14,384 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 228.73/202.41 [2019-03-28 12:45:14,384 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 228.73/202.41 [2019-03-28 12:45:14,385 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 228.73/202.41 [2019-03-28 12:45:14,387 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 228.73/202.41 [2019-03-28 12:45:14,387 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 228.73/202.41 [2019-03-28 12:45:14,388 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 228.73/202.41 [2019-03-28 12:45:14,390 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 228.73/202.41 [2019-03-28 12:45:14,392 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 228.73/202.41 [2019-03-28 12:45:14,393 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 228.73/202.41 [2019-03-28 12:45:14,394 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 228.73/202.41 [2019-03-28 12:45:14,396 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 228.73/202.41 [2019-03-28 12:45:14,398 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 228.73/202.41 [2019-03-28 12:45:14,398 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 228.73/202.41 [2019-03-28 12:45:14,398 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 228.73/202.41 [2019-03-28 12:45:14,399 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 228.73/202.41 [2019-03-28 12:45:14,399 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 228.73/202.41 [2019-03-28 12:45:14,400 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 228.73/202.41 [2019-03-28 12:45:14,401 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 228.73/202.41 [2019-03-28 12:45:14,401 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 228.73/202.41 [2019-03-28 12:45:14,402 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 228.73/202.41 [2019-03-28 12:45:14,403 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 228.73/202.41 [2019-03-28 12:45:14,404 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 228.73/202.41 [2019-03-28 12:45:14,405 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 228.73/202.41 [2019-03-28 12:45:14,405 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 228.73/202.41 [2019-03-28 12:45:14,405 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 228.73/202.41 [2019-03-28 12:45:14,406 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 228.73/202.41 [2019-03-28 12:45:14,407 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 228.73/202.41 [2019-03-28 12:45:14,407 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 228.73/202.41 [2019-03-28 12:45:14,407 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 228.73/202.41 [2019-03-28 12:45:14,422 INFO L110 SettingsManager]: Loading preferences was successful 228.73/202.41 [2019-03-28 12:45:14,422 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 228.73/202.41 [2019-03-28 12:45:14,424 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 228.73/202.41 [2019-03-28 12:45:14,424 INFO L133 SettingsManager]: * Rewrite not-equals=true 228.73/202.41 [2019-03-28 12:45:14,424 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 228.73/202.41 [2019-03-28 12:45:14,424 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 228.73/202.41 [2019-03-28 12:45:14,424 INFO L133 SettingsManager]: * Use SBE=true 228.73/202.41 [2019-03-28 12:45:14,424 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 228.73/202.41 [2019-03-28 12:45:14,425 INFO L133 SettingsManager]: * Use old map elimination=false 228.73/202.41 [2019-03-28 12:45:14,425 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 228.73/202.41 [2019-03-28 12:45:14,425 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 228.73/202.41 [2019-03-28 12:45:14,425 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 228.73/202.41 [2019-03-28 12:45:14,425 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 228.73/202.41 [2019-03-28 12:45:14,426 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 228.73/202.41 [2019-03-28 12:45:14,426 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 228.73/202.41 [2019-03-28 12:45:14,426 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 228.73/202.41 [2019-03-28 12:45:14,426 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 228.73/202.41 [2019-03-28 12:45:14,426 INFO L133 SettingsManager]: * Check division by zero=IGNORE 228.73/202.41 [2019-03-28 12:45:14,426 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 228.73/202.41 [2019-03-28 12:45:14,427 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 228.73/202.41 [2019-03-28 12:45:14,427 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 228.73/202.41 [2019-03-28 12:45:14,427 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 228.73/202.41 [2019-03-28 12:45:14,427 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 228.73/202.41 [2019-03-28 12:45:14,427 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 228.73/202.41 [2019-03-28 12:45:14,428 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 228.73/202.41 [2019-03-28 12:45:14,428 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 228.73/202.41 [2019-03-28 12:45:14,428 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 228.73/202.41 [2019-03-28 12:45:14,428 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 228.73/202.41 [2019-03-28 12:45:14,428 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 228.73/202.41 [2019-03-28 12:45:14,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 228.73/202.41 [2019-03-28 12:45:14,469 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 228.73/202.41 [2019-03-28 12:45:14,473 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 228.73/202.41 [2019-03-28 12:45:14,474 INFO L271 PluginConnector]: Initializing CDTParser... 228.73/202.41 [2019-03-28 12:45:14,475 INFO L276 PluginConnector]: CDTParser initialized 228.73/202.41 [2019-03-28 12:45:14,475 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 228.73/202.41 [2019-03-28 12:45:14,556 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/85288903de5d4c8fb3a8af2d44c6ad79/FLAG431c846a8 228.73/202.41 [2019-03-28 12:45:14,894 INFO L307 CDTParser]: Found 1 translation units. 228.73/202.41 [2019-03-28 12:45:14,895 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 228.73/202.41 [2019-03-28 12:45:14,895 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 228.73/202.41 [2019-03-28 12:45:14,901 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/85288903de5d4c8fb3a8af2d44c6ad79/FLAG431c846a8 228.73/202.41 [2019-03-28 12:45:15,322 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/85288903de5d4c8fb3a8af2d44c6ad79 228.73/202.41 [2019-03-28 12:45:15,334 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 228.73/202.41 [2019-03-28 12:45:15,336 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 228.73/202.41 [2019-03-28 12:45:15,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 228.73/202.41 [2019-03-28 12:45:15,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 228.73/202.41 [2019-03-28 12:45:15,340 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 228.73/202.41 [2019-03-28 12:45:15,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:45:15" (1/1) ... 228.73/202.41 [2019-03-28 12:45:15,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3490f492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:15, skipping insertion in model container 228.73/202.41 [2019-03-28 12:45:15,345 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:45:15" (1/1) ... 228.73/202.41 [2019-03-28 12:45:15,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 228.73/202.41 [2019-03-28 12:45:15,370 INFO L176 MainTranslator]: Built tables and reachable declarations 228.73/202.41 [2019-03-28 12:45:15,531 INFO L206 PostProcessor]: Analyzing one entry point: main 228.73/202.41 [2019-03-28 12:45:15,545 INFO L191 MainTranslator]: Completed pre-run 228.73/202.41 [2019-03-28 12:45:15,624 INFO L206 PostProcessor]: Analyzing one entry point: main 228.73/202.41 [2019-03-28 12:45:15,641 INFO L195 MainTranslator]: Completed translation 228.73/202.41 [2019-03-28 12:45:15,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:15 WrapperNode 228.73/202.41 [2019-03-28 12:45:15,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 228.73/202.41 [2019-03-28 12:45:15,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 228.73/202.41 [2019-03-28 12:45:15,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 228.73/202.41 [2019-03-28 12:45:15,643 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 228.73/202.41 [2019-03-28 12:45:15,654 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:45:15" (1/1) ... 228.73/202.41 [2019-03-28 12:45:15,663 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:45:15" (1/1) ... 228.73/202.41 [2019-03-28 12:45:15,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 228.73/202.41 [2019-03-28 12:45:15,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 228.73/202.41 [2019-03-28 12:45:15,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 228.73/202.41 [2019-03-28 12:45:15,686 INFO L276 PluginConnector]: Boogie Preprocessor initialized 228.73/202.41 [2019-03-28 12:45:15,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:15" (1/1) ... 228.73/202.41 [2019-03-28 12:45:15,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:15" (1/1) ... 228.73/202.41 [2019-03-28 12:45:15,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:15" (1/1) ... 228.73/202.41 [2019-03-28 12:45:15,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:15" (1/1) ... 228.73/202.41 [2019-03-28 12:45:15,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:15" (1/1) ... 228.73/202.41 [2019-03-28 12:45:15,708 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:15" (1/1) ... 228.73/202.41 [2019-03-28 12:45:15,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:15" (1/1) ... 228.73/202.41 [2019-03-28 12:45:15,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 228.73/202.41 [2019-03-28 12:45:15,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 228.73/202.41 [2019-03-28 12:45:15,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... 228.73/202.41 [2019-03-28 12:45:15,712 INFO L276 PluginConnector]: RCFGBuilder initialized 228.73/202.41 [2019-03-28 12:45:15,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:15" (1/1) ... 228.73/202.41 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 228.73/202.41 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 228.73/202.41 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 228.73/202.41 [2019-03-28 12:45:15,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 228.73/202.41 [2019-03-28 12:45:15,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 228.73/202.41 [2019-03-28 12:45:15,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 228.73/202.41 [2019-03-28 12:45:15,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 228.73/202.41 [2019-03-28 12:45:15,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 228.73/202.41 [2019-03-28 12:45:15,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 228.73/202.41 [2019-03-28 12:45:16,107 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 228.73/202.41 [2019-03-28 12:45:16,108 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 228.73/202.41 [2019-03-28 12:45:16,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:16 BoogieIcfgContainer 228.73/202.41 [2019-03-28 12:45:16,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 228.73/202.41 [2019-03-28 12:45:16,110 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 228.73/202.41 [2019-03-28 12:45:16,110 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 228.73/202.41 [2019-03-28 12:45:16,113 INFO L276 PluginConnector]: BlockEncodingV2 initialized 228.73/202.41 [2019-03-28 12:45:16,116 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:16" (1/1) ... 228.73/202.41 [2019-03-28 12:45:16,134 INFO L313 BlockEncoder]: Initial Icfg 46 locations, 47 edges 228.73/202.41 [2019-03-28 12:45:16,136 INFO L258 BlockEncoder]: Using Remove infeasible edges 228.73/202.41 [2019-03-28 12:45:16,136 INFO L263 BlockEncoder]: Using Maximize final states 228.73/202.41 [2019-03-28 12:45:16,137 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 228.73/202.41 [2019-03-28 12:45:16,137 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 228.73/202.41 [2019-03-28 12:45:16,139 INFO L296 BlockEncoder]: Using Remove sink states 228.73/202.41 [2019-03-28 12:45:16,140 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 228.73/202.41 [2019-03-28 12:45:16,140 INFO L179 BlockEncoder]: Using Rewrite not-equals 228.73/202.41 [2019-03-28 12:45:16,166 INFO L185 BlockEncoder]: Using Use SBE 228.73/202.41 [2019-03-28 12:45:16,203 INFO L200 BlockEncoder]: SBE split 23 edges 228.73/202.41 [2019-03-28 12:45:16,208 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 228.73/202.41 [2019-03-28 12:45:16,210 INFO L71 MaximizeFinalStates]: 0 new accepting states 228.73/202.41 [2019-03-28 12:45:16,243 INFO L100 BaseMinimizeStates]: Removed 18 edges and 9 locations by large block encoding 228.73/202.41 [2019-03-28 12:45:16,246 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 228.73/202.41 [2019-03-28 12:45:16,248 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 228.73/202.41 [2019-03-28 12:45:16,248 INFO L71 MaximizeFinalStates]: 0 new accepting states 228.73/202.41 [2019-03-28 12:45:16,251 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 228.73/202.41 [2019-03-28 12:45:16,252 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 228.73/202.41 [2019-03-28 12:45:16,253 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 228.73/202.41 [2019-03-28 12:45:16,253 INFO L71 MaximizeFinalStates]: 0 new accepting states 228.73/202.41 [2019-03-28 12:45:16,253 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 228.73/202.41 [2019-03-28 12:45:16,254 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 228.73/202.41 [2019-03-28 12:45:16,254 INFO L313 BlockEncoder]: Encoded RCFG 35 locations, 64 edges 228.73/202.41 [2019-03-28 12:45:16,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:45:16 BasicIcfg 228.73/202.41 [2019-03-28 12:45:16,255 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 228.73/202.41 [2019-03-28 12:45:16,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 228.73/202.41 [2019-03-28 12:45:16,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... 228.73/202.41 [2019-03-28 12:45:16,259 INFO L276 PluginConnector]: TraceAbstraction initialized 228.73/202.41 [2019-03-28 12:45:16,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:45:15" (1/4) ... 228.73/202.41 [2019-03-28 12:45:16,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502788d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:45:16, skipping insertion in model container 228.73/202.41 [2019-03-28 12:45:16,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:15" (2/4) ... 228.73/202.41 [2019-03-28 12:45:16,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502788d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:45:16, skipping insertion in model container 228.73/202.41 [2019-03-28 12:45:16,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:16" (3/4) ... 228.73/202.41 [2019-03-28 12:45:16,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502788d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:45:16, skipping insertion in model container 228.73/202.41 [2019-03-28 12:45:16,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:45:16" (4/4) ... 228.73/202.41 [2019-03-28 12:45:16,265 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 228.73/202.41 [2019-03-28 12:45:16,275 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 228.73/202.41 [2019-03-28 12:45:16,284 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. 228.73/202.41 [2019-03-28 12:45:16,301 INFO L257 AbstractCegarLoop]: Starting to check reachability of 22 error locations. 228.73/202.41 [2019-03-28 12:45:16,331 INFO L133 ementStrategyFactory]: Using default assertion order modulation 228.73/202.41 [2019-03-28 12:45:16,332 INFO L382 AbstractCegarLoop]: Interprodecural is true 228.73/202.41 [2019-03-28 12:45:16,332 INFO L383 AbstractCegarLoop]: Hoare is true 228.73/202.41 [2019-03-28 12:45:16,332 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 228.73/202.41 [2019-03-28 12:45:16,332 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 228.73/202.41 [2019-03-28 12:45:16,332 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 228.73/202.41 [2019-03-28 12:45:16,332 INFO L387 AbstractCegarLoop]: Difference is false 228.73/202.41 [2019-03-28 12:45:16,333 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 228.73/202.41 [2019-03-28 12:45:16,333 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 228.73/202.41 [2019-03-28 12:45:16,348 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. 228.73/202.41 [2019-03-28 12:45:16,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 228.73/202.41 [2019-03-28 12:45:16,354 INFO L394 BasicCegarLoop]: Found error trace 228.73/202.41 [2019-03-28 12:45:16,355 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 228.73/202.41 [2019-03-28 12:45:16,355 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 228.73/202.41 [2019-03-28 12:45:16,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 228.73/202.41 [2019-03-28 12:45:16,361 INFO L82 PathProgramCache]: Analyzing trace with hash 125222, now seen corresponding path program 1 times 228.73/202.41 [2019-03-28 12:45:16,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 228.73/202.41 [2019-03-28 12:45:16,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 228.73/202.41 [2019-03-28 12:45:16,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:16,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:16,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 228.73/202.41 [2019-03-28 12:45:16,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 228.73/202.41 [2019-03-28 12:45:16,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 228.73/202.41 [2019-03-28 12:45:16,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 228.73/202.41 [2019-03-28 12:45:16,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 228.73/202.41 [2019-03-28 12:45:16,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 228.73/202.41 [2019-03-28 12:45:16,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 228.73/202.41 [2019-03-28 12:45:16,571 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. 228.73/202.41 [2019-03-28 12:45:16,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 228.73/202.41 [2019-03-28 12:45:16,740 INFO L93 Difference]: Finished difference Result 35 states and 64 transitions. 228.73/202.41 [2019-03-28 12:45:16,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 228.73/202.41 [2019-03-28 12:45:16,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 228.73/202.41 [2019-03-28 12:45:16,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 228.73/202.41 [2019-03-28 12:45:16,756 INFO L225 Difference]: With dead ends: 35 228.73/202.41 [2019-03-28 12:45:16,756 INFO L226 Difference]: Without dead ends: 31 228.73/202.41 [2019-03-28 12:45:16,760 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 228.73/202.41 [2019-03-28 12:45:16,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 228.73/202.41 [2019-03-28 12:45:16,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. 228.73/202.41 [2019-03-28 12:45:16,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 228.73/202.41 [2019-03-28 12:45:16,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 56 transitions. 228.73/202.41 [2019-03-28 12:45:16,800 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 56 transitions. Word has length 3 228.73/202.41 [2019-03-28 12:45:16,801 INFO L84 Accepts]: Finished accepts. word is rejected. 228.73/202.41 [2019-03-28 12:45:16,802 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 56 transitions. 228.73/202.41 [2019-03-28 12:45:16,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 228.73/202.41 [2019-03-28 12:45:16,802 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 56 transitions. 228.73/202.41 [2019-03-28 12:45:16,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 228.73/202.41 [2019-03-28 12:45:16,802 INFO L394 BasicCegarLoop]: Found error trace 228.73/202.41 [2019-03-28 12:45:16,803 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 228.73/202.41 [2019-03-28 12:45:16,803 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 228.73/202.41 [2019-03-28 12:45:16,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 228.73/202.41 [2019-03-28 12:45:16,803 INFO L82 PathProgramCache]: Analyzing trace with hash 125224, now seen corresponding path program 1 times 228.73/202.41 [2019-03-28 12:45:16,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 228.73/202.41 [2019-03-28 12:45:16,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 228.73/202.41 [2019-03-28 12:45:16,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:16,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:16,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 228.73/202.41 [2019-03-28 12:45:16,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 228.73/202.41 [2019-03-28 12:45:16,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 228.73/202.41 [2019-03-28 12:45:16,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 228.73/202.41 [2019-03-28 12:45:16,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 228.73/202.41 [2019-03-28 12:45:16,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 228.73/202.41 [2019-03-28 12:45:16,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 228.73/202.41 [2019-03-28 12:45:16,854 INFO L87 Difference]: Start difference. First operand 31 states and 56 transitions. Second operand 3 states. 228.73/202.41 [2019-03-28 12:45:16,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 228.73/202.41 [2019-03-28 12:45:16,964 INFO L93 Difference]: Finished difference Result 31 states and 56 transitions. 228.73/202.41 [2019-03-28 12:45:16,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 228.73/202.41 [2019-03-28 12:45:16,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 228.73/202.41 [2019-03-28 12:45:16,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 228.73/202.41 [2019-03-28 12:45:16,966 INFO L225 Difference]: With dead ends: 31 228.73/202.41 [2019-03-28 12:45:16,967 INFO L226 Difference]: Without dead ends: 27 228.73/202.41 [2019-03-28 12:45:16,968 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 228.73/202.41 [2019-03-28 12:45:16,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 228.73/202.41 [2019-03-28 12:45:16,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 228.73/202.41 [2019-03-28 12:45:16,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 228.73/202.41 [2019-03-28 12:45:16,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 48 transitions. 228.73/202.41 [2019-03-28 12:45:16,974 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 48 transitions. Word has length 3 228.73/202.41 [2019-03-28 12:45:16,974 INFO L84 Accepts]: Finished accepts. word is rejected. 228.73/202.41 [2019-03-28 12:45:16,974 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 48 transitions. 228.73/202.41 [2019-03-28 12:45:16,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 228.73/202.41 [2019-03-28 12:45:16,974 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 48 transitions. 228.73/202.41 [2019-03-28 12:45:16,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 228.73/202.41 [2019-03-28 12:45:16,975 INFO L394 BasicCegarLoop]: Found error trace 228.73/202.41 [2019-03-28 12:45:16,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 228.73/202.41 [2019-03-28 12:45:16,975 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 228.73/202.41 [2019-03-28 12:45:16,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 228.73/202.41 [2019-03-28 12:45:16,976 INFO L82 PathProgramCache]: Analyzing trace with hash 3883390, now seen corresponding path program 1 times 228.73/202.41 [2019-03-28 12:45:16,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 228.73/202.41 [2019-03-28 12:45:16,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 228.73/202.41 [2019-03-28 12:45:16,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:16,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:16,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 228.73/202.41 [2019-03-28 12:45:17,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 228.73/202.41 [2019-03-28 12:45:17,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 228.73/202.41 [2019-03-28 12:45:17,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 228.73/202.41 [2019-03-28 12:45:17,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 228.73/202.41 [2019-03-28 12:45:17,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 228.73/202.41 [2019-03-28 12:45:17,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 228.73/202.41 [2019-03-28 12:45:17,004 INFO L87 Difference]: Start difference. First operand 27 states and 48 transitions. Second operand 3 states. 228.73/202.41 [2019-03-28 12:45:17,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 228.73/202.41 [2019-03-28 12:45:17,069 INFO L93 Difference]: Finished difference Result 30 states and 48 transitions. 228.73/202.41 [2019-03-28 12:45:17,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 228.73/202.41 [2019-03-28 12:45:17,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 228.73/202.41 [2019-03-28 12:45:17,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 228.73/202.41 [2019-03-28 12:45:17,070 INFO L225 Difference]: With dead ends: 30 228.73/202.41 [2019-03-28 12:45:17,071 INFO L226 Difference]: Without dead ends: 27 228.73/202.41 [2019-03-28 12:45:17,071 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 228.73/202.41 [2019-03-28 12:45:17,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 228.73/202.41 [2019-03-28 12:45:17,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 228.73/202.41 [2019-03-28 12:45:17,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 228.73/202.41 [2019-03-28 12:45:17,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 45 transitions. 228.73/202.41 [2019-03-28 12:45:17,076 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 45 transitions. Word has length 4 228.73/202.41 [2019-03-28 12:45:17,076 INFO L84 Accepts]: Finished accepts. word is rejected. 228.73/202.41 [2019-03-28 12:45:17,076 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 45 transitions. 228.73/202.41 [2019-03-28 12:45:17,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 228.73/202.41 [2019-03-28 12:45:17,076 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 45 transitions. 228.73/202.41 [2019-03-28 12:45:17,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 228.73/202.41 [2019-03-28 12:45:17,077 INFO L394 BasicCegarLoop]: Found error trace 228.73/202.41 [2019-03-28 12:45:17,077 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 228.73/202.41 [2019-03-28 12:45:17,077 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 228.73/202.41 [2019-03-28 12:45:17,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 228.73/202.41 [2019-03-28 12:45:17,077 INFO L82 PathProgramCache]: Analyzing trace with hash 3883387, now seen corresponding path program 1 times 228.73/202.41 [2019-03-28 12:45:17,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 228.73/202.41 [2019-03-28 12:45:17,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 228.73/202.41 [2019-03-28 12:45:17,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:17,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:17,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 228.73/202.41 [2019-03-28 12:45:17,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 228.73/202.41 [2019-03-28 12:45:17,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 228.73/202.41 [2019-03-28 12:45:17,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 228.73/202.41 [2019-03-28 12:45:17,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 228.73/202.41 [2019-03-28 12:45:17,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 228.73/202.41 [2019-03-28 12:45:17,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 228.73/202.41 [2019-03-28 12:45:17,121 INFO L87 Difference]: Start difference. First operand 27 states and 45 transitions. Second operand 3 states. 228.73/202.41 [2019-03-28 12:45:17,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 228.73/202.41 [2019-03-28 12:45:17,206 INFO L93 Difference]: Finished difference Result 27 states and 45 transitions. 228.73/202.41 [2019-03-28 12:45:17,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 228.73/202.41 [2019-03-28 12:45:17,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 228.73/202.41 [2019-03-28 12:45:17,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 228.73/202.41 [2019-03-28 12:45:17,208 INFO L225 Difference]: With dead ends: 27 228.73/202.41 [2019-03-28 12:45:17,208 INFO L226 Difference]: Without dead ends: 24 228.73/202.41 [2019-03-28 12:45:17,208 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 228.73/202.41 [2019-03-28 12:45:17,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. 228.73/202.41 [2019-03-28 12:45:17,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. 228.73/202.41 [2019-03-28 12:45:17,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 228.73/202.41 [2019-03-28 12:45:17,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. 228.73/202.41 [2019-03-28 12:45:17,213 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 4 228.73/202.41 [2019-03-28 12:45:17,213 INFO L84 Accepts]: Finished accepts. word is rejected. 228.73/202.41 [2019-03-28 12:45:17,213 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. 228.73/202.41 [2019-03-28 12:45:17,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 228.73/202.41 [2019-03-28 12:45:17,213 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. 228.73/202.41 [2019-03-28 12:45:17,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 228.73/202.41 [2019-03-28 12:45:17,214 INFO L394 BasicCegarLoop]: Found error trace 228.73/202.41 [2019-03-28 12:45:17,214 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 228.73/202.41 [2019-03-28 12:45:17,214 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 228.73/202.41 [2019-03-28 12:45:17,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 228.73/202.41 [2019-03-28 12:45:17,215 INFO L82 PathProgramCache]: Analyzing trace with hash 3883389, now seen corresponding path program 1 times 228.73/202.41 [2019-03-28 12:45:17,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 228.73/202.41 [2019-03-28 12:45:17,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 228.73/202.41 [2019-03-28 12:45:17,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:17,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:17,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 228.73/202.41 [2019-03-28 12:45:17,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 228.73/202.41 [2019-03-28 12:45:17,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 228.73/202.41 [2019-03-28 12:45:17,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 228.73/202.41 [2019-03-28 12:45:17,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 228.73/202.41 [2019-03-28 12:45:17,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 228.73/202.41 [2019-03-28 12:45:17,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 228.73/202.41 [2019-03-28 12:45:17,257 INFO L87 Difference]: Start difference. First operand 24 states and 39 transitions. Second operand 3 states. 228.73/202.41 [2019-03-28 12:45:17,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 228.73/202.41 [2019-03-28 12:45:17,342 INFO L93 Difference]: Finished difference Result 24 states and 39 transitions. 228.73/202.41 [2019-03-28 12:45:17,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 228.73/202.41 [2019-03-28 12:45:17,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 228.73/202.41 [2019-03-28 12:45:17,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 228.73/202.41 [2019-03-28 12:45:17,344 INFO L225 Difference]: With dead ends: 24 228.73/202.41 [2019-03-28 12:45:17,344 INFO L226 Difference]: Without dead ends: 21 228.73/202.41 [2019-03-28 12:45:17,345 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 228.73/202.41 [2019-03-28 12:45:17,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. 228.73/202.41 [2019-03-28 12:45:17,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. 228.73/202.41 [2019-03-28 12:45:17,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 228.73/202.41 [2019-03-28 12:45:17,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. 228.73/202.41 [2019-03-28 12:45:17,349 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 36 transitions. Word has length 4 228.73/202.41 [2019-03-28 12:45:17,349 INFO L84 Accepts]: Finished accepts. word is rejected. 228.73/202.41 [2019-03-28 12:45:17,349 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 36 transitions. 228.73/202.41 [2019-03-28 12:45:17,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 228.73/202.41 [2019-03-28 12:45:17,350 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 36 transitions. 228.73/202.41 [2019-03-28 12:45:17,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 228.73/202.41 [2019-03-28 12:45:17,350 INFO L394 BasicCegarLoop]: Found error trace 228.73/202.41 [2019-03-28 12:45:17,350 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 228.73/202.41 [2019-03-28 12:45:17,350 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 228.73/202.41 [2019-03-28 12:45:17,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 228.73/202.41 [2019-03-28 12:45:17,351 INFO L82 PathProgramCache]: Analyzing trace with hash 120386413, now seen corresponding path program 1 times 228.73/202.41 [2019-03-28 12:45:17,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 228.73/202.41 [2019-03-28 12:45:17,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 228.73/202.41 [2019-03-28 12:45:17,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:17,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:17,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 228.73/202.41 [2019-03-28 12:45:17,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 228.73/202.41 [2019-03-28 12:45:17,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 228.73/202.41 [2019-03-28 12:45:17,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 228.73/202.41 [2019-03-28 12:45:17,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 228.73/202.41 [2019-03-28 12:45:17,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 228.73/202.41 [2019-03-28 12:45:17,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 228.73/202.41 [2019-03-28 12:45:17,393 INFO L87 Difference]: Start difference. First operand 21 states and 36 transitions. Second operand 3 states. 228.73/202.41 [2019-03-28 12:45:17,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 228.73/202.41 [2019-03-28 12:45:17,481 INFO L93 Difference]: Finished difference Result 21 states and 36 transitions. 228.73/202.41 [2019-03-28 12:45:17,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 228.73/202.41 [2019-03-28 12:45:17,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 228.73/202.41 [2019-03-28 12:45:17,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 228.73/202.41 [2019-03-28 12:45:17,483 INFO L225 Difference]: With dead ends: 21 228.73/202.41 [2019-03-28 12:45:17,483 INFO L226 Difference]: Without dead ends: 17 228.73/202.41 [2019-03-28 12:45:17,484 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 228.73/202.41 [2019-03-28 12:45:17,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. 228.73/202.41 [2019-03-28 12:45:17,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 228.73/202.41 [2019-03-28 12:45:17,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 228.73/202.41 [2019-03-28 12:45:17,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. 228.73/202.41 [2019-03-28 12:45:17,487 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 28 transitions. Word has length 5 228.73/202.41 [2019-03-28 12:45:17,487 INFO L84 Accepts]: Finished accepts. word is rejected. 228.73/202.41 [2019-03-28 12:45:17,487 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 28 transitions. 228.73/202.41 [2019-03-28 12:45:17,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 228.73/202.41 [2019-03-28 12:45:17,487 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 28 transitions. 228.73/202.41 [2019-03-28 12:45:17,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 228.73/202.41 [2019-03-28 12:45:17,488 INFO L394 BasicCegarLoop]: Found error trace 228.73/202.41 [2019-03-28 12:45:17,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 228.73/202.41 [2019-03-28 12:45:17,489 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 228.73/202.41 [2019-03-28 12:45:17,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 228.73/202.41 [2019-03-28 12:45:17,489 INFO L82 PathProgramCache]: Analyzing trace with hash 120386415, now seen corresponding path program 1 times 228.73/202.41 [2019-03-28 12:45:17,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 228.73/202.41 [2019-03-28 12:45:17,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 228.73/202.41 [2019-03-28 12:45:17,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:17,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:17,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 228.73/202.41 [2019-03-28 12:45:17,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 228.73/202.41 [2019-03-28 12:45:17,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 228.73/202.41 [2019-03-28 12:45:17,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 228.73/202.41 [2019-03-28 12:45:17,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 228.73/202.41 [2019-03-28 12:45:17,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 228.73/202.41 [2019-03-28 12:45:17,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 228.73/202.41 [2019-03-28 12:45:17,529 INFO L87 Difference]: Start difference. First operand 17 states and 28 transitions. Second operand 3 states. 228.73/202.41 [2019-03-28 12:45:17,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 228.73/202.41 [2019-03-28 12:45:17,572 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. 228.73/202.41 [2019-03-28 12:45:17,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 228.73/202.41 [2019-03-28 12:45:17,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 228.73/202.41 [2019-03-28 12:45:17,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 228.73/202.41 [2019-03-28 12:45:17,573 INFO L225 Difference]: With dead ends: 21 228.73/202.41 [2019-03-28 12:45:17,573 INFO L226 Difference]: Without dead ends: 17 228.73/202.41 [2019-03-28 12:45:17,574 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 228.73/202.41 [2019-03-28 12:45:17,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. 228.73/202.41 [2019-03-28 12:45:17,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 228.73/202.41 [2019-03-28 12:45:17,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 228.73/202.41 [2019-03-28 12:45:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. 228.73/202.41 [2019-03-28 12:45:17,577 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 5 228.73/202.41 [2019-03-28 12:45:17,577 INFO L84 Accepts]: Finished accepts. word is rejected. 228.73/202.41 [2019-03-28 12:45:17,577 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 24 transitions. 228.73/202.41 [2019-03-28 12:45:17,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 228.73/202.41 [2019-03-28 12:45:17,577 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. 228.73/202.41 [2019-03-28 12:45:17,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 228.73/202.41 [2019-03-28 12:45:17,578 INFO L394 BasicCegarLoop]: Found error trace 228.73/202.41 [2019-03-28 12:45:17,578 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 228.73/202.41 [2019-03-28 12:45:17,578 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 228.73/202.41 [2019-03-28 12:45:17,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 228.73/202.41 [2019-03-28 12:45:17,579 INFO L82 PathProgramCache]: Analyzing trace with hash 120386416, now seen corresponding path program 1 times 228.73/202.41 [2019-03-28 12:45:17,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 228.73/202.41 [2019-03-28 12:45:17,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 228.73/202.41 [2019-03-28 12:45:17,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:17,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:17,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 228.73/202.41 [2019-03-28 12:45:17,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 228.73/202.41 [2019-03-28 12:45:17,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 228.73/202.41 [2019-03-28 12:45:17,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 228.73/202.41 [2019-03-28 12:45:17,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 228.73/202.41 [2019-03-28 12:45:17,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 228.73/202.41 [2019-03-28 12:45:17,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 228.73/202.41 [2019-03-28 12:45:17,617 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. Second operand 3 states. 228.73/202.41 [2019-03-28 12:45:17,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 228.73/202.41 [2019-03-28 12:45:17,662 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. 228.73/202.41 [2019-03-28 12:45:17,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 228.73/202.41 [2019-03-28 12:45:17,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 228.73/202.41 [2019-03-28 12:45:17,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 228.73/202.41 [2019-03-28 12:45:17,663 INFO L225 Difference]: With dead ends: 17 228.73/202.41 [2019-03-28 12:45:17,663 INFO L226 Difference]: Without dead ends: 0 228.73/202.41 [2019-03-28 12:45:17,664 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 228.73/202.41 [2019-03-28 12:45:17,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 228.73/202.41 [2019-03-28 12:45:17,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 228.73/202.41 [2019-03-28 12:45:17,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 228.73/202.41 [2019-03-28 12:45:17,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 228.73/202.41 [2019-03-28 12:45:17,664 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 228.73/202.41 [2019-03-28 12:45:17,665 INFO L84 Accepts]: Finished accepts. word is rejected. 228.73/202.41 [2019-03-28 12:45:17,665 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 228.73/202.41 [2019-03-28 12:45:17,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 228.73/202.41 [2019-03-28 12:45:17,665 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 228.73/202.41 [2019-03-28 12:45:17,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 228.73/202.41 [2019-03-28 12:45:17,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 228.73/202.41 [2019-03-28 12:45:17,702 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,703 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,703 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,703 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,703 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,703 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,703 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,703 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,703 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,704 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,704 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,704 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,704 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,705 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,705 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,705 INFO L444 ceAbstractionStarter]: At program point L13-3(lines 13 17) the Hoare annotation is: (and (= ULTIMATE.start_main_~z~0.offset 0) (= (select |#valid| ULTIMATE.start_main_~y~0.base) 1) (= (select |#length| ULTIMATE.start_main_~z~0.base) 4) (= (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) (= (select |#valid| ULTIMATE.start_main_~z~0.base) 1) (= 4 (select |#length| ULTIMATE.start_main_~x~0.base)) (= ULTIMATE.start_main_~y~0.offset 0)) 228.73/202.41 [2019-03-28 12:45:17,705 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,705 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,706 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,706 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,706 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,706 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,706 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,706 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,706 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,706 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,707 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,707 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,707 INFO L448 ceAbstractionStarter]: For program point L14-2(line 14) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,707 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,707 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,707 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,707 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,708 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,708 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 228.73/202.41 [2019-03-28 12:45:17,708 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 228.73/202.41 [2019-03-28 12:45:17,717 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 228.73/202.41 [2019-03-28 12:45:17,718 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 228.73/202.41 [2019-03-28 12:45:17,718 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 228.73/202.41 [2019-03-28 12:45:17,726 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 228.73/202.41 [2019-03-28 12:45:17,726 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 228.73/202.41 [2019-03-28 12:45:17,726 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 228.73/202.41 [2019-03-28 12:45:17,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:45:17 BasicIcfg 228.73/202.41 [2019-03-28 12:45:17,729 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 228.73/202.41 [2019-03-28 12:45:17,730 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 228.73/202.41 [2019-03-28 12:45:17,730 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 228.73/202.41 [2019-03-28 12:45:17,733 INFO L276 PluginConnector]: BuchiAutomizer initialized 228.73/202.41 [2019-03-28 12:45:17,734 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 228.73/202.41 [2019-03-28 12:45:17,734 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:45:15" (1/5) ... 228.73/202.41 [2019-03-28 12:45:17,734 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fa49c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:45:17, skipping insertion in model container 228.73/202.41 [2019-03-28 12:45:17,735 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 228.73/202.41 [2019-03-28 12:45:17,735 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:15" (2/5) ... 228.73/202.41 [2019-03-28 12:45:17,735 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fa49c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:45:17, skipping insertion in model container 228.73/202.41 [2019-03-28 12:45:17,735 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 228.73/202.41 [2019-03-28 12:45:17,735 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:16" (3/5) ... 228.73/202.41 [2019-03-28 12:45:17,736 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fa49c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:45:17, skipping insertion in model container 228.73/202.41 [2019-03-28 12:45:17,736 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 228.73/202.41 [2019-03-28 12:45:17,736 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:45:16" (4/5) ... 228.73/202.41 [2019-03-28 12:45:17,736 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fa49c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:45:17, skipping insertion in model container 228.73/202.41 [2019-03-28 12:45:17,736 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 228.73/202.41 [2019-03-28 12:45:17,736 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:45:17" (5/5) ... 228.73/202.41 [2019-03-28 12:45:17,738 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 228.73/202.41 [2019-03-28 12:45:17,759 INFO L133 ementStrategyFactory]: Using default assertion order modulation 228.73/202.41 [2019-03-28 12:45:17,759 INFO L374 BuchiCegarLoop]: Interprodecural is true 228.73/202.41 [2019-03-28 12:45:17,759 INFO L375 BuchiCegarLoop]: Hoare is true 228.73/202.41 [2019-03-28 12:45:17,759 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 228.73/202.41 [2019-03-28 12:45:17,760 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 228.73/202.41 [2019-03-28 12:45:17,760 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 228.73/202.41 [2019-03-28 12:45:17,760 INFO L379 BuchiCegarLoop]: Difference is false 228.73/202.41 [2019-03-28 12:45:17,760 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 228.73/202.41 [2019-03-28 12:45:17,760 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 228.73/202.41 [2019-03-28 12:45:17,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. 228.73/202.41 [2019-03-28 12:45:17,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 228.73/202.41 [2019-03-28 12:45:17,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 228.73/202.41 [2019-03-28 12:45:17,770 INFO L119 BuchiIsEmpty]: Starting construction of run 228.73/202.41 [2019-03-28 12:45:17,775 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 228.73/202.41 [2019-03-28 12:45:17,775 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 228.73/202.41 [2019-03-28 12:45:17,775 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 228.73/202.41 [2019-03-28 12:45:17,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. 228.73/202.41 [2019-03-28 12:45:17,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 228.73/202.41 [2019-03-28 12:45:17,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 228.73/202.41 [2019-03-28 12:45:17,777 INFO L119 BuchiIsEmpty]: Starting construction of run 228.73/202.41 [2019-03-28 12:45:17,778 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 228.73/202.41 [2019-03-28 12:45:17,778 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 228.73/202.41 [2019-03-28 12:45:17,783 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue [95] 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] 12#L-1true [136] L-1-->L9: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |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|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_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|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6] 10#L9true [181] L9-->L10: Formula: (and (= 1 (select |v_#valid_33| v_ULTIMATE.start_main_~x~0.base_16)) (= (store |v_#memory_int_19| v_ULTIMATE.start_main_~x~0.base_16 (store (select |v_#memory_int_19| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12 |v_ULTIMATE.start_main_#t~nondet3_5|)) |v_#memory_int_18|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_27| v_ULTIMATE.start_main_~x~0.base_16))) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 13#L10true [182] L10-->L11: Formula: (and (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 |v_ULTIMATE.start_main_#t~nondet4_5|)) |v_#memory_int_20|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_28| v_ULTIMATE.start_main_~y~0.base_13)) (= (select |v_#valid_34| v_ULTIMATE.start_main_~y~0.base_13) 1) (<= 0 v_ULTIMATE.start_main_~y~0.offset_10)) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] 32#L11true [183] L11-->L13-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_12 4) (select |v_#length_29| v_ULTIMATE.start_main_~z~0.base_16)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_12) (= 1 (select |v_#valid_35| v_ULTIMATE.start_main_~z~0.base_16)) (= (store |v_#memory_int_23| v_ULTIMATE.start_main_~z~0.base_16 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~z~0.base_16) v_ULTIMATE.start_main_~z~0.offset_12 |v_ULTIMATE.start_main_#t~nondet5_5|)) |v_#memory_int_22|)) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_23|, #length=|v_#length_29|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_22|, #length=|v_#length_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int] 29#L13-3true 228.73/202.41 [2019-03-28 12:45:17,784 INFO L796 eck$LassoCheckResult]: Loop: 29#L13-3true [190] L13-3-->L14: Formula: (and (= 1 (select |v_#valid_45| v_ULTIMATE.start_main_~x~0.base_18)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_14 4) (select |v_#length_33| v_ULTIMATE.start_main_~x~0.base_18)) (< 0 (select (select |v_#memory_int_30| v_ULTIMATE.start_main_~x~0.base_18) v_ULTIMATE.start_main_~x~0.offset_14)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_14)) InVars {#valid=|v_#valid_45|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_30|, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_18} OutVars{#valid=|v_#valid_45|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_30|, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_18, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 20#L14true [82] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_13| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= (select |v_#valid_15| v_ULTIMATE.start_main_~x~0.base_10) 1) (<= 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_8|, #length=|v_#length_13|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_15|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 19#L14-1true [78] L14-1-->L14-2: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~y~0.base_7))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 17#L14-2true [187] L14-2-->L15: Formula: (and (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~x~0.base_17)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_30| v_ULTIMATE.start_main_~x~0.base_17)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem7_6| |v_ULTIMATE.start_main_#t~mem8_6|))) |v_#memory_int_24|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13)) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_30|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_30|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, #memory_int] 22#L15true [86] L15-->L15-1: Formula: (and (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~z~0.base_7)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_19| v_ULTIMATE.start_main_~z~0.base_7))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 36#L15-1true [188] L15-1-->L16: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_11) (= 1 (select |v_#valid_43| v_ULTIMATE.start_main_~y~0.base_14)) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~y~0.base_14 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~y~0.base_14) v_ULTIMATE.start_main_~y~0.offset_11 |v_ULTIMATE.start_main_#t~mem9_6|)) |v_#memory_int_26|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_11 4) (select |v_#length_31| v_ULTIMATE.start_main_~y~0.base_14))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_14, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_11, #length=|v_#length_31|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_14, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_11, #length=|v_#length_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 6#L16true [62] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_8 4) (select |v_#length_23| v_ULTIMATE.start_main_~z~0.base_10)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~z~0.base_10)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem10_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~z~0.base_10) v_ULTIMATE.start_main_~z~0.offset_8))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_10, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_8, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_10, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 4#L16-1true [189] L16-1-->L13-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_main_~z~0.base_17)) (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~z~0.base_17 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~z~0.base_17) v_ULTIMATE.start_main_~z~0.offset_13 (+ (* (- 1) |v_ULTIMATE.start_main_#t~mem10_6|) (- 1)))) |v_#memory_int_28|) (<= 0 v_ULTIMATE.start_main_~z~0.offset_13) (= (select |v_#valid_44| v_ULTIMATE.start_main_~z~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_17, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_13, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_29|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_17, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_13, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, #memory_int] 29#L13-3true 228.73/202.41 [2019-03-28 12:45:17,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 228.73/202.41 [2019-03-28 12:45:17,785 INFO L82 PathProgramCache]: Analyzing trace with hash 120594988, now seen corresponding path program 1 times 228.73/202.41 [2019-03-28 12:45:17,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 228.73/202.41 [2019-03-28 12:45:17,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 228.73/202.41 [2019-03-28 12:45:17,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:17,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:17,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 228.73/202.41 [2019-03-28 12:45:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 228.73/202.41 [2019-03-28 12:45:17,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 228.73/202.41 [2019-03-28 12:45:17,834 INFO L82 PathProgramCache]: Analyzing trace with hash 783402215, now seen corresponding path program 1 times 228.73/202.41 [2019-03-28 12:45:17,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 228.73/202.41 [2019-03-28 12:45:17,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 228.73/202.41 [2019-03-28 12:45:17,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:17,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:17,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 228.73/202.41 [2019-03-28 12:45:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 228.73/202.41 [2019-03-28 12:45:17,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 228.73/202.41 [2019-03-28 12:45:17,860 INFO L82 PathProgramCache]: Analyzing trace with hash 69110802, now seen corresponding path program 1 times 228.73/202.41 [2019-03-28 12:45:17,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 228.73/202.41 [2019-03-28 12:45:17,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 228.73/202.41 [2019-03-28 12:45:17,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:17,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:17,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.73/202.41 [2019-03-28 12:45:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 228.73/202.41 [2019-03-28 12:45:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 228.73/202.41 [2019-03-28 12:45:18,321 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 228.73/202.41 [2019-03-28 12:45:18,442 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 71 228.73/202.41 [2019-03-28 12:45:18,456 INFO L216 LassoAnalysis]: Preferences: 228.73/202.41 [2019-03-28 12:45:18,457 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 228.73/202.41 [2019-03-28 12:45:18,458 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 228.73/202.41 [2019-03-28 12:45:18,458 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 228.73/202.41 [2019-03-28 12:45:18,458 INFO L127 ssoRankerPreferences]: Use exernal solver: false 228.73/202.41 [2019-03-28 12:45:18,458 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 228.73/202.41 [2019-03-28 12:45:18,458 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 228.73/202.41 [2019-03-28 12:45:18,458 INFO L130 ssoRankerPreferences]: Path of dumped script: 228.73/202.41 [2019-03-28 12:45:18,458 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 228.73/202.41 [2019-03-28 12:45:18,459 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 228.73/202.41 [2019-03-28 12:45:18,459 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 228.73/202.41 [2019-03-28 12:45:18,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 228.73/202.41 [2019-03-28 12:45:18,760 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 228.73/202.41 [2019-03-28 12:45:18,882 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 228.73/202.41 [2019-03-28 12:45:18,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 228.73/202.41 [2019-03-28 12:45:18,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 228.73/202.41 [2019-03-28 12:45:18,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 228.73/202.41 [2019-03-28 12:45:18,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 228.73/202.41 [2019-03-28 12:45:18,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 228.73/202.41 [2019-03-28 12:45:18,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 228.73/202.41 [2019-03-28 12:45:18,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 228.73/202.41 [2019-03-28 12:45:18,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 228.73/202.41 [2019-03-28 12:45:18,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 228.73/202.41 [2019-03-28 12:45:18,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 228.73/202.41 [2019-03-28 12:45:18,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 228.73/202.41 [2019-03-28 12:45:18,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 228.73/202.41 [2019-03-28 12:45:19,309 INFO L300 LassoAnalysis]: Preprocessing complete. 228.73/202.41 [2019-03-28 12:45:19,314 INFO L497 LassoAnalysis]: Using template 'affine'. 228.73/202.41 [2019-03-28 12:45:19,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.73/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.73/202.41 Number of strict supporting invariants: 0 228.73/202.41 Number of non-strict supporting invariants: 1 228.73/202.41 Consider only non-deceasing supporting invariants: true 228.73/202.41 Simplify termination arguments: true 228.73/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.73/202.41 [2019-03-28 12:45:19,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.73/202.41 [2019-03-28 12:45:19,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.73/202.41 [2019-03-28 12:45:19,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.73/202.41 [2019-03-28 12:45:19,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.73/202.41 [2019-03-28 12:45:19,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 228.73/202.41 [2019-03-28 12:45:19,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 228.73/202.41 [2019-03-28 12:45:19,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.73/202.41 [2019-03-28 12:45:19,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.73/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.73/202.41 Number of strict supporting invariants: 0 228.73/202.41 Number of non-strict supporting invariants: 1 228.73/202.41 Consider only non-deceasing supporting invariants: true 228.73/202.41 Simplify termination arguments: true 228.73/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.73/202.41 [2019-03-28 12:45:19,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.73/202.41 [2019-03-28 12:45:19,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.73/202.41 [2019-03-28 12:45:19,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.73/202.41 [2019-03-28 12:45:19,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.73/202.41 [2019-03-28 12:45:19,340 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 228.73/202.41 [2019-03-28 12:45:19,340 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 228.73/202.41 [2019-03-28 12:45:19,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,353 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,353 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,367 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,367 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,423 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,437 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,442 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,442 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.41 [2019-03-28 12:45:19,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.41 [2019-03-28 12:45:19,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.41 [2019-03-28 12:45:19,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.41 [2019-03-28 12:45:19,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.41 [2019-03-28 12:45:19,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.41 [2019-03-28 12:45:19,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.41 [2019-03-28 12:45:19,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.41 [2019-03-28 12:45:19,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.41 [2019-03-28 12:45:19,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,485 INFO L497 LassoAnalysis]: Using template '2-nested'. 228.86/202.41 [2019-03-28 12:45:19,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,486 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,488 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,488 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,497 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,498 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,498 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,508 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,510 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,510 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,518 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,521 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,522 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,548 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,550 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,550 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,559 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,560 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,561 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,578 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,579 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,579 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,582 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,583 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,584 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,593 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,594 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,594 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,598 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,599 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,599 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.41 [2019-03-28 12:45:19,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,608 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,609 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.41 [2019-03-28 12:45:19,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,611 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,611 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.41 [2019-03-28 12:45:19,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,613 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,613 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.41 [2019-03-28 12:45:19,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,615 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,616 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.41 [2019-03-28 12:45:19,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,618 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,618 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,620 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,621 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,621 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,624 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,625 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,625 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.41 [2019-03-28 12:45:19,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,628 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,629 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.41 [2019-03-28 12:45:19,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,631 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,631 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,633 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,634 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,634 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.41 [2019-03-28 12:45:19,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,637 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,638 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.41 [2019-03-28 12:45:19,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,640 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,640 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,641 INFO L497 LassoAnalysis]: Using template '3-nested'. 228.86/202.41 [2019-03-28 12:45:19,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,642 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,644 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,644 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,653 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,655 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,655 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,666 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,667 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,668 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,676 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,681 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,681 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,712 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,714 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,714 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:45:19,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:45:19,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:45:19,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:45:19,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:45:19,723 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 228.86/202.41 [2019-03-28 12:45:19,726 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:45:19,726 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 228.86/202.41 [2019-03-28 12:45:19,751 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 228.86/202.41 [2019-03-28 12:45:19,787 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. 228.86/202.41 [2019-03-28 12:45:19,787 INFO L444 ModelExtractionUtils]: 19 out of 29 variables were initially zero. Simplification set additionally 3 variables to zero. 228.86/202.41 [2019-03-28 12:45:19,789 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 228.86/202.41 [2019-03-28 12:45:19,791 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. 228.86/202.41 [2019-03-28 12:45:19,792 INFO L518 LassoAnalysis]: Proved termination. 228.86/202.41 [2019-03-28 12:45:19,792 INFO L520 LassoAnalysis]: Termination argument consisting of: 228.86/202.41 Ranking function 3-nested ranking function: 228.86/202.41 f0 = 2*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_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1 + 2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 228.86/202.41 f1 = 3*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_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 228.86/202.41 f2 = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 228.86/202.41 Supporting invariants [] 228.86/202.41 [2019-03-28 12:45:19,931 INFO L297 tatePredicateManager]: 20 out of 24 supporting invariants were superfluous and have been removed 228.86/202.41 [2019-03-28 12:45:19,941 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.41 [2019-03-28 12:45:19,941 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.41 [2019-03-28 12:45:19,941 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.41 [2019-03-28 12:45:19,942 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.41 [2019-03-28 12:45:19,942 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.41 [2019-03-28 12:45:19,944 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.41 [2019-03-28 12:45:19,944 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.41 [2019-03-28 12:45:19,945 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.41 [2019-03-28 12:45:19,945 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.41 [2019-03-28 12:45:19,945 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.41 [2019-03-28 12:45:19,945 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.41 [2019-03-28 12:45:19,946 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.41 [2019-03-28 12:45:19,946 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.41 [2019-03-28 12:45:19,946 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.41 [2019-03-28 12:45:19,946 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.41 [2019-03-28 12:45:19,946 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.41 [2019-03-28 12:45:19,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 228.86/202.41 [2019-03-28 12:45:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 228.86/202.41 [2019-03-28 12:45:20,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 13 conjunts are in the unsatisfiable core 228.86/202.41 [2019-03-28 12:45:20,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... 228.86/202.41 [2019-03-28 12:45:20,053 INFO L189 IndexEqualityManager]: detected not equals via solver 228.86/202.41 [2019-03-28 12:45:20,071 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 228.86/202.41 [2019-03-28 12:45:20,071 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 228.86/202.41 [2019-03-28 12:45:20,145 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 228.86/202.41 [2019-03-28 12:45:20,146 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 228.86/202.41 [2019-03-28 12:45:20,146 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:18 228.86/202.41 [2019-03-28 12:45:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 228.86/202.41 [2019-03-28 12:45:20,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 18 conjunts are in the unsatisfiable core 228.86/202.41 [2019-03-28 12:45:20,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... 228.86/202.41 [2019-03-28 12:45:20,442 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 228.86/202.41 [2019-03-28 12:45:20,640 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 71 228.86/202.41 [2019-03-28 12:45:20,642 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.41 [2019-03-28 12:45:20,674 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 81 228.86/202.41 [2019-03-28 12:45:20,676 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.41 [2019-03-28 12:45:20,707 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 82 228.86/202.41 [2019-03-28 12:45:20,710 INFO L427 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.41 [2019-03-28 12:45:20,747 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 71 228.86/202.41 [2019-03-28 12:45:20,749 INFO L427 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.41 [2019-03-28 12:45:20,780 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 71 228.86/202.41 [2019-03-28 12:45:20,782 INFO L427 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.41 [2019-03-28 12:45:20,812 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 88 228.86/202.41 [2019-03-28 12:45:20,815 INFO L427 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.41 [2019-03-28 12:45:20,843 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 75 228.86/202.41 [2019-03-28 12:45:20,845 INFO L427 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.41 [2019-03-28 12:45:20,872 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 75 228.86/202.41 [2019-03-28 12:45:20,874 INFO L427 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.41 [2019-03-28 12:45:20,891 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 71 228.86/202.41 [2019-03-28 12:45:20,893 INFO L427 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.41 [2019-03-28 12:45:21,271 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 100 228.86/202.41 [2019-03-28 12:45:21,271 INFO L497 ElimStorePlain]: treesize reduction 293, result has 61.0 percent of original size 228.86/202.41 [2019-03-28 12:45:21,281 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. 228.86/202.41 [2019-03-28 12:45:21,281 INFO L217 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:972, output treesize:423 228.86/202.41 [2019-03-28 12:45:21,485 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 71 228.86/202.41 [2019-03-28 12:45:21,627 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 72 228.86/202.41 [2019-03-28 12:45:21,629 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.41 [2019-03-28 12:45:21,724 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 228.86/202.41 [2019-03-28 12:45:21,732 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 68 228.86/202.41 [2019-03-28 12:45:21,734 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.41 [2019-03-28 12:45:21,814 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 228.86/202.41 [2019-03-28 12:45:21,821 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 68 228.86/202.41 [2019-03-28 12:45:21,823 INFO L427 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.41 [2019-03-28 12:45:21,901 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 228.86/202.41 [2019-03-28 12:45:21,903 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. 228.86/202.41 [2019-03-28 12:45:21,903 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:259, output treesize:207 228.86/202.41 [2019-03-28 12:45:22,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 228.86/202.41 [2019-03-28 12:45:25,892 WARN L188 SmtUtils]: Spent 741.00 ms on a formula simplification that was a NOOP. DAG size: 55 228.86/202.41 [2019-03-28 12:46:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 228.86/202.41 [2019-03-28 12:46:03,950 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 228.86/202.41 [2019-03-28 12:46:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 228.86/202.41 [2019-03-28 12:46:03,964 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 228.86/202.41 [2019-03-28 12:46:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 228.86/202.41 [2019-03-28 12:46:03,978 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 228.86/202.41 [2019-03-28 12:46:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 228.86/202.41 [2019-03-28 12:46:03,991 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 228.86/202.41 [2019-03-28 12:46:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 228.86/202.41 [2019-03-28 12:46:04,004 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 228.86/202.41 [2019-03-28 12:46:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 228.86/202.41 [2019-03-28 12:46:04,016 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 228.86/202.41 [2019-03-28 12:46:04,016 INFO L98 LoopCannibalizer]: 37 predicates before loop cannibalization 37 predicates after loop cannibalization 228.86/202.41 [2019-03-28 12:46:04,021 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 37 loop predicates 228.86/202.41 [2019-03-28 12:46:04,021 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 35 states. Second operand 10 states. 228.86/202.41 [2019-03-28 12:46:06,305 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 38 228.86/202.41 [2019-03-28 12:46:06,947 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 40 228.86/202.41 [2019-03-28 12:46:07,564 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 40 228.86/202.41 [2019-03-28 12:46:11,144 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 40 228.86/202.41 [2019-03-28 12:46:11,605 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 42 228.86/202.41 [2019-03-28 12:46:12,055 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 42 228.86/202.41 [2019-03-28 12:46:16,329 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 42 228.86/202.41 [2019-03-28 12:46:17,425 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 44 228.86/202.41 [2019-03-28 12:46:17,863 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 44 228.86/202.41 [2019-03-28 12:46:26,897 WARN L188 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 117 DAG size of output: 66 228.86/202.41 [2019-03-28 12:46:39,782 WARN L188 SmtUtils]: Spent 909.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 51 228.86/202.41 [2019-03-28 12:46:44,778 WARN L188 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 119 DAG size of output: 68 228.86/202.41 [2019-03-28 12:46:50,273 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 53 228.86/202.41 [2019-03-28 12:47:45,659 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 35 states.. Second operand 10 states. Result 715 states and 1218 transitions. Complement of second has 219 states. 228.86/202.41 [2019-03-28 12:47:45,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 62 states 9 stem states 49 non-accepting loop states 4 accepting loop states 228.86/202.41 [2019-03-28 12:47:45,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 228.86/202.41 [2019-03-28 12:47:45,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 717 transitions. 228.86/202.41 [2019-03-28 12:47:45,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 717 transitions. Stem has 5 letters. Loop has 8 letters. 228.86/202.41 [2019-03-28 12:47:45,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. 228.86/202.41 [2019-03-28 12:47:45,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 717 transitions. Stem has 13 letters. Loop has 8 letters. 228.86/202.41 [2019-03-28 12:47:45,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. 228.86/202.41 [2019-03-28 12:47:45,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 717 transitions. Stem has 5 letters. Loop has 16 letters. 228.86/202.41 [2019-03-28 12:47:45,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. 228.86/202.41 [2019-03-28 12:47:45,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 715 states and 1218 transitions. 228.86/202.41 [2019-03-28 12:47:45,704 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 56 228.86/202.41 [2019-03-28 12:47:45,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 715 states to 123 states and 129 transitions. 228.86/202.41 [2019-03-28 12:47:45,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 228.86/202.41 [2019-03-28 12:47:45,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 228.86/202.41 [2019-03-28 12:47:45,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 129 transitions. 228.86/202.41 [2019-03-28 12:47:45,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 228.86/202.41 [2019-03-28 12:47:45,710 INFO L706 BuchiCegarLoop]: Abstraction has 123 states and 129 transitions. 228.86/202.41 [2019-03-28 12:47:45,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 129 transitions. 228.86/202.41 [2019-03-28 12:47:45,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 13. 228.86/202.41 [2019-03-28 12:47:45,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 228.86/202.41 [2019-03-28 12:47:45,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. 228.86/202.41 [2019-03-28 12:47:45,713 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. 228.86/202.41 [2019-03-28 12:47:45,713 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. 228.86/202.41 [2019-03-28 12:47:45,713 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 228.86/202.41 [2019-03-28 12:47:45,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. 228.86/202.41 [2019-03-28 12:47:45,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 228.86/202.41 [2019-03-28 12:47:45,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 228.86/202.41 [2019-03-28 12:47:45,714 INFO L119 BuchiIsEmpty]: Starting construction of run 228.86/202.41 [2019-03-28 12:47:45,715 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 228.86/202.41 [2019-03-28 12:47:45,715 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 228.86/202.41 [2019-03-28 12:47:45,716 INFO L794 eck$LassoCheckResult]: Stem: 1306#ULTIMATE.startENTRY [95] 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] 1303#L-1 [135] L-1-->L9: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4)) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> |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|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_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|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6] 1301#L9 [181] L9-->L10: Formula: (and (= 1 (select |v_#valid_33| v_ULTIMATE.start_main_~x~0.base_16)) (= (store |v_#memory_int_19| v_ULTIMATE.start_main_~x~0.base_16 (store (select |v_#memory_int_19| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12 |v_ULTIMATE.start_main_#t~nondet3_5|)) |v_#memory_int_18|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_27| v_ULTIMATE.start_main_~x~0.base_16))) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 1302#L10 [182] L10-->L11: Formula: (and (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 |v_ULTIMATE.start_main_#t~nondet4_5|)) |v_#memory_int_20|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_28| v_ULTIMATE.start_main_~y~0.base_13)) (= (select |v_#valid_34| v_ULTIMATE.start_main_~y~0.base_13) 1) (<= 0 v_ULTIMATE.start_main_~y~0.offset_10)) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] 1304#L11 [183] L11-->L13-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_12 4) (select |v_#length_29| v_ULTIMATE.start_main_~z~0.base_16)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_12) (= 1 (select |v_#valid_35| v_ULTIMATE.start_main_~z~0.base_16)) (= (store |v_#memory_int_23| v_ULTIMATE.start_main_~z~0.base_16 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~z~0.base_16) v_ULTIMATE.start_main_~z~0.offset_12 |v_ULTIMATE.start_main_#t~nondet5_5|)) |v_#memory_int_22|)) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_23|, #length=|v_#length_29|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_22|, #length=|v_#length_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int] 1297#L13-3 228.86/202.41 [2019-03-28 12:47:45,716 INFO L796 eck$LassoCheckResult]: Loop: 1297#L13-3 [190] L13-3-->L14: Formula: (and (= 1 (select |v_#valid_45| v_ULTIMATE.start_main_~x~0.base_18)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_14 4) (select |v_#length_33| v_ULTIMATE.start_main_~x~0.base_18)) (< 0 (select (select |v_#memory_int_30| v_ULTIMATE.start_main_~x~0.base_18) v_ULTIMATE.start_main_~x~0.offset_14)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_14)) InVars {#valid=|v_#valid_45|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_30|, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_18} OutVars{#valid=|v_#valid_45|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_30|, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_18, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 1305#L14 [82] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_13| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= (select |v_#valid_15| v_ULTIMATE.start_main_~x~0.base_10) 1) (<= 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_8|, #length=|v_#length_13|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_15|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 1308#L14-1 [78] L14-1-->L14-2: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~y~0.base_7))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 1307#L14-2 [187] L14-2-->L15: Formula: (and (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~x~0.base_17)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_30| v_ULTIMATE.start_main_~x~0.base_17)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem7_6| |v_ULTIMATE.start_main_#t~mem8_6|))) |v_#memory_int_24|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13)) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_30|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_30|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, #memory_int] 1298#L15 [86] L15-->L15-1: Formula: (and (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~z~0.base_7)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_19| v_ULTIMATE.start_main_~z~0.base_7))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 1299#L15-1 [188] L15-1-->L16: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_11) (= 1 (select |v_#valid_43| v_ULTIMATE.start_main_~y~0.base_14)) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~y~0.base_14 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~y~0.base_14) v_ULTIMATE.start_main_~y~0.offset_11 |v_ULTIMATE.start_main_#t~mem9_6|)) |v_#memory_int_26|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_11 4) (select |v_#length_31| v_ULTIMATE.start_main_~y~0.base_14))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_14, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_11, #length=|v_#length_31|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_14, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_11, #length=|v_#length_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 1300#L16 [62] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_8 4) (select |v_#length_23| v_ULTIMATE.start_main_~z~0.base_10)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~z~0.base_10)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem10_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~z~0.base_10) v_ULTIMATE.start_main_~z~0.offset_8))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_10, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_8, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_10, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 1296#L16-1 [189] L16-1-->L13-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_main_~z~0.base_17)) (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~z~0.base_17 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~z~0.base_17) v_ULTIMATE.start_main_~z~0.offset_13 (+ (* (- 1) |v_ULTIMATE.start_main_#t~mem10_6|) (- 1)))) |v_#memory_int_28|) (<= 0 v_ULTIMATE.start_main_~z~0.offset_13) (= (select |v_#valid_44| v_ULTIMATE.start_main_~z~0.base_17) 1)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_17, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_13, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_29|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_17, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_13, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, #memory_int] 1297#L13-3 228.86/202.41 [2019-03-28 12:47:45,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 228.86/202.41 [2019-03-28 12:47:45,717 INFO L82 PathProgramCache]: Analyzing trace with hash 120565197, now seen corresponding path program 1 times 228.86/202.41 [2019-03-28 12:47:45,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 228.86/202.41 [2019-03-28 12:47:45,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 228.86/202.41 [2019-03-28 12:47:45,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.86/202.41 [2019-03-28 12:47:45,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 228.86/202.41 [2019-03-28 12:47:45,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.86/202.41 [2019-03-28 12:47:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 228.86/202.41 [2019-03-28 12:47:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 228.86/202.41 [2019-03-28 12:47:45,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 228.86/202.41 [2019-03-28 12:47:45,736 INFO L82 PathProgramCache]: Analyzing trace with hash 783402215, now seen corresponding path program 2 times 228.86/202.41 [2019-03-28 12:47:45,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 228.86/202.41 [2019-03-28 12:47:45,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 228.86/202.41 [2019-03-28 12:47:45,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.86/202.41 [2019-03-28 12:47:45,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 228.86/202.41 [2019-03-28 12:47:45,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.86/202.41 [2019-03-28 12:47:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 228.86/202.41 [2019-03-28 12:47:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 228.86/202.41 [2019-03-28 12:47:45,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 228.86/202.41 [2019-03-28 12:47:45,750 INFO L82 PathProgramCache]: Analyzing trace with hash -59971917, now seen corresponding path program 1 times 228.86/202.41 [2019-03-28 12:47:45,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 228.86/202.41 [2019-03-28 12:47:45,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 228.86/202.41 [2019-03-28 12:47:45,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.86/202.41 [2019-03-28 12:47:45,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 228.86/202.41 [2019-03-28 12:47:45,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 228.86/202.41 [2019-03-28 12:47:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 228.86/202.41 [2019-03-28 12:47:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 228.86/202.41 [2019-03-28 12:47:46,303 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 85 228.86/202.41 [2019-03-28 12:47:46,488 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 79 228.86/202.41 [2019-03-28 12:47:46,492 INFO L216 LassoAnalysis]: Preferences: 228.86/202.41 [2019-03-28 12:47:46,493 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 228.86/202.41 [2019-03-28 12:47:46,493 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 228.86/202.41 [2019-03-28 12:47:46,493 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 228.86/202.41 [2019-03-28 12:47:46,493 INFO L127 ssoRankerPreferences]: Use exernal solver: false 228.86/202.41 [2019-03-28 12:47:46,493 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 228.86/202.41 [2019-03-28 12:47:46,493 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 228.86/202.41 [2019-03-28 12:47:46,493 INFO L130 ssoRankerPreferences]: Path of dumped script: 228.86/202.41 [2019-03-28 12:47:46,494 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 228.86/202.41 [2019-03-28 12:47:46,494 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 228.86/202.41 [2019-03-28 12:47:46,494 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 228.86/202.41 [2019-03-28 12:47:46,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 228.86/202.41 [2019-03-28 12:47:46,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 228.86/202.41 [2019-03-28 12:47:46,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 228.86/202.41 [2019-03-28 12:47:46,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 228.86/202.41 [2019-03-28 12:47:46,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 228.86/202.41 [2019-03-28 12:47:46,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 228.86/202.41 [2019-03-28 12:47:46,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 228.86/202.41 [2019-03-28 12:47:46,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 228.86/202.41 [2019-03-28 12:47:46,836 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 228.86/202.41 [2019-03-28 12:47:46,951 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 228.86/202.41 [2019-03-28 12:47:46,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 228.86/202.41 [2019-03-28 12:47:46,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 228.86/202.41 [2019-03-28 12:47:46,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 228.86/202.41 [2019-03-28 12:47:46,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 228.86/202.41 [2019-03-28 12:47:47,125 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 228.86/202.41 [2019-03-28 12:47:47,356 INFO L300 LassoAnalysis]: Preprocessing complete. 228.86/202.41 [2019-03-28 12:47:47,356 INFO L497 LassoAnalysis]: Using template 'affine'. 228.86/202.41 [2019-03-28 12:47:47,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:47:47,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:47:47,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.41 [2019-03-28 12:47:47,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:47:47,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:47:47,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:47:47,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:47:47,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.41 [2019-03-28 12:47:47,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:47:47,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:47:47,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:47:47,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.41 [2019-03-28 12:47:47,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:47:47,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:47:47,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:47:47,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:47:47,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.41 [2019-03-28 12:47:47,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:47:47,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:47:47,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:47:47,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:47:47,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:47:47,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:47:47,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:47:47,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 228.86/202.41 [2019-03-28 12:47:47,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:47:47,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:47:47,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:47:47,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.41 [2019-03-28 12:47:47,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:47:47,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:47:47,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:47:47,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:47:47,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.41 [2019-03-28 12:47:47,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:47:47,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:47:47,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:47:47,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.41 [2019-03-28 12:47:47,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:47:47,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:47:47,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:47:47,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:47:47,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.41 [2019-03-28 12:47:47,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:47:47,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:47:47,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:47:47,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.41 [2019-03-28 12:47:47,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:47:47,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:47:47,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:47:47,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:47:47,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.41 [2019-03-28 12:47:47,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:47:47,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:47:47,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:47:47,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.41 [2019-03-28 12:47:47,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:47:47,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:47:47,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:47:47,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:47:47,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.41 [2019-03-28 12:47:47,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:47:47,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:47:47,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:47:47,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:47:47,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:47:47,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:47:47,374 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:47:47,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 228.86/202.41 [2019-03-28 12:47:47,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:47:47,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:47:47,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:47:47,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:47:47,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:47:47,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:47:47,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:47:47,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 228.86/202.41 [2019-03-28 12:47:47,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:47:47,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:47:47,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:47:47,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:47:47,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:47:47,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:47:47,386 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:47:47,386 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 228.86/202.41 [2019-03-28 12:47:47,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:47:47,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:47:47,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:47:47,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:47:47,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:47:47,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:47:47,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:47:47,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 228.86/202.41 [2019-03-28 12:47:47,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:47:47,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:47:47,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:47:47,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:47:47,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:47:47,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:47:47,414 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:47:47,414 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 228.86/202.41 [2019-03-28 12:47:47,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:47:47,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:47:47,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:47:47,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:47:47,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:47:47,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:47:47,417 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:47:47,417 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 228.86/202.41 [2019-03-28 12:47:47,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:47:47,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:47:47,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:47:47,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:47:47,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:47:47,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:47:47,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:47:47,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 228.86/202.41 [2019-03-28 12:47:47,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:47:47,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:47:47,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:47:47,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.41 [2019-03-28 12:47:47,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:47:47,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:47:47,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:47:47,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:47:47,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.41 [2019-03-28 12:47:47,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:47:47,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.41 Number of strict supporting invariants: 0 228.86/202.41 Number of non-strict supporting invariants: 1 228.86/202.41 Consider only non-deceasing supporting invariants: true 228.86/202.41 Simplify termination arguments: true 228.86/202.41 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.41 [2019-03-28 12:47:47,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.41 [2019-03-28 12:47:47,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.41 [2019-03-28 12:47:47,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.41 [2019-03-28 12:47:47,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.41 [2019-03-28 12:47:47,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.41 [2019-03-28 12:47:47,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 228.86/202.41 [2019-03-28 12:47:47,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.41 [2019-03-28 12:47:47,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.41 [2019-03-28 12:47:47,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.41 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.42 [2019-03-28 12:47:47,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,437 INFO L497 LassoAnalysis]: Using template '2-nested'. 228.86/202.42 [2019-03-28 12:47:47,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.42 [2019-03-28 12:47:47,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,438 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,438 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.42 [2019-03-28 12:47:47,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,440 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,440 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,442 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,442 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,443 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.42 [2019-03-28 12:47:47,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,445 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,445 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.42 [2019-03-28 12:47:47,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,447 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,447 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.42 [2019-03-28 12:47:47,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,449 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,449 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.42 [2019-03-28 12:47:47,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,451 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,451 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,453 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,453 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,454 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,459 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,460 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,461 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,467 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,468 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,468 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,478 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,481 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,481 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,498 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,499 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,499 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,501 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,502 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,502 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,509 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,510 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,510 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.42 [2019-03-28 12:47:47,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,520 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,520 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.42 [2019-03-28 12:47:47,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,522 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,523 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,524 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,525 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,525 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.42 [2019-03-28 12:47:47,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,528 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,528 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,529 INFO L497 LassoAnalysis]: Using template '3-nested'. 228.86/202.42 [2019-03-28 12:47:47,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.42 [2019-03-28 12:47:47,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,530 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,530 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.42 [2019-03-28 12:47:47,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,532 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,532 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,534 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,535 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,535 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.42 [2019-03-28 12:47:47,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,538 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,538 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.42 [2019-03-28 12:47:47,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,540 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,540 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.42 [2019-03-28 12:47:47,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,542 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,542 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 228.86/202.42 [2019-03-28 12:47:47,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,544 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,544 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,546 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,547 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,547 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,554 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,556 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,556 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,563 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,565 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,565 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,578 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,581 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,581 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,602 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,603 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,603 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,606 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,607 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,607 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 228.86/202.42 [2019-03-28 12:47:47,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 228.86/202.42 Termination analysis: LINEAR_WITH_GUESSES 228.86/202.42 Number of strict supporting invariants: 0 228.86/202.42 Number of non-strict supporting invariants: 1 228.86/202.42 Consider only non-deceasing supporting invariants: true 228.86/202.42 Simplify termination arguments: true 228.86/202.42 Simplify supporting invariants: trueOverapproximate stem: false 228.86/202.42 [2019-03-28 12:47:47,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. 228.86/202.42 [2019-03-28 12:47:47,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 228.86/202.42 [2019-03-28 12:47:47,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 228.86/202.42 [2019-03-28 12:47:47,614 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 228.86/202.42 [2019-03-28 12:47:47,616 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. 228.86/202.42 [2019-03-28 12:47:47,616 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. 228.86/202.42 [2019-03-28 12:47:47,631 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 228.86/202.42 [2019-03-28 12:47:47,650 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. 228.86/202.42 [2019-03-28 12:47:47,650 INFO L444 ModelExtractionUtils]: 19 out of 29 variables were initially zero. Simplification set additionally 3 variables to zero. 228.86/202.42 [2019-03-28 12:47:47,650 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 228.86/202.42 [2019-03-28 12:47:47,651 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. 228.86/202.42 [2019-03-28 12:47:47,652 INFO L518 LassoAnalysis]: Proved termination. 228.86/202.42 [2019-03-28 12:47:47,652 INFO L520 LassoAnalysis]: Termination argument consisting of: 228.86/202.42 Ranking function 3-nested ranking function: 228.86/202.42 f0 = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 + 2*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2 228.86/202.42 f1 = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 + 3*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 228.86/202.42 f2 = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 228.86/202.42 Supporting invariants [] 228.86/202.42 [2019-03-28 12:47:47,792 INFO L297 tatePredicateManager]: 20 out of 24 supporting invariants were superfluous and have been removed 228.86/202.42 [2019-03-28 12:47:47,799 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.42 [2019-03-28 12:47:47,800 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.42 [2019-03-28 12:47:47,800 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.42 [2019-03-28 12:47:47,800 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.42 [2019-03-28 12:47:47,800 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.42 [2019-03-28 12:47:47,802 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.42 [2019-03-28 12:47:47,802 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.42 [2019-03-28 12:47:47,802 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.42 [2019-03-28 12:47:47,803 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.42 [2019-03-28 12:47:47,803 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.42 [2019-03-28 12:47:47,803 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.42 [2019-03-28 12:47:47,803 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.42 [2019-03-28 12:47:47,804 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.42 [2019-03-28 12:47:47,804 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.42 [2019-03-28 12:47:47,804 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.42 [2019-03-28 12:47:47,804 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 228.86/202.42 [2019-03-28 12:47:47,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 228.86/202.42 [2019-03-28 12:47:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 228.86/202.42 [2019-03-28 12:47:47,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 12 conjunts are in the unsatisfiable core 228.86/202.42 [2019-03-28 12:47:47,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... 228.86/202.42 [2019-03-28 12:47:47,869 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 228.86/202.42 [2019-03-28 12:47:47,870 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 27 228.86/202.42 [2019-03-28 12:47:47,870 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 228.86/202.42 [2019-03-28 12:47:47,879 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 228.86/202.42 [2019-03-28 12:47:47,880 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 228.86/202.42 [2019-03-28 12:47:47,880 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:17 228.86/202.42 [2019-03-28 12:47:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 228.86/202.42 [2019-03-28 12:47:47,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 16 conjunts are in the unsatisfiable core 228.86/202.42 [2019-03-28 12:47:47,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... 228.86/202.42 [2019-03-28 12:47:48,164 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 228.86/202.42 [2019-03-28 12:47:48,336 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 71 228.86/202.42 [2019-03-28 12:47:48,338 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.42 [2019-03-28 12:47:48,359 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 71 228.86/202.42 [2019-03-28 12:47:48,360 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.42 [2019-03-28 12:47:48,382 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 75 228.86/202.42 [2019-03-28 12:47:48,383 INFO L427 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.42 [2019-03-28 12:47:48,406 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 71 228.86/202.42 [2019-03-28 12:47:48,407 INFO L427 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.42 [2019-03-28 12:47:48,430 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 75 228.86/202.42 [2019-03-28 12:47:48,432 INFO L427 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.42 [2019-03-28 12:47:48,454 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 88 228.86/202.42 [2019-03-28 12:47:48,456 INFO L427 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.42 [2019-03-28 12:47:48,477 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 71 228.86/202.42 [2019-03-28 12:47:48,478 INFO L427 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.42 [2019-03-28 12:47:48,500 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 82 228.86/202.42 [2019-03-28 12:47:48,501 INFO L427 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.42 [2019-03-28 12:47:48,515 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 81 228.86/202.42 [2019-03-28 12:47:48,516 INFO L427 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.42 [2019-03-28 12:47:48,868 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 100 228.86/202.42 [2019-03-28 12:47:48,869 INFO L497 ElimStorePlain]: treesize reduction 293, result has 61.0 percent of original size 228.86/202.42 [2019-03-28 12:47:48,874 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. 228.86/202.42 [2019-03-28 12:47:48,874 INFO L217 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:972, output treesize:423 228.86/202.42 [2019-03-28 12:47:49,062 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 71 228.86/202.42 [2019-03-28 12:47:49,207 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 71 228.86/202.42 [2019-03-28 12:47:49,208 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.42 [2019-03-28 12:47:49,226 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 75 228.86/202.42 [2019-03-28 12:47:49,228 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.42 [2019-03-28 12:47:49,237 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 71 228.86/202.42 [2019-03-28 12:47:49,239 INFO L427 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.42 [2019-03-28 12:47:49,320 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 228.86/202.42 [2019-03-28 12:47:49,322 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. 228.86/202.42 [2019-03-28 12:47:49,322 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:268, output treesize:207 228.86/202.42 [2019-03-28 12:47:49,501 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 77 228.86/202.42 [2019-03-28 12:47:50,260 WARN L188 SmtUtils]: Spent 628.00 ms on a formula simplification that was a NOOP. DAG size: 79 228.86/202.42 [2019-03-28 12:47:50,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 228.86/202.42 [2019-03-28 12:47:52,291 WARN L188 SmtUtils]: Spent 1.42 s on a formula simplification that was a NOOP. DAG size: 44 228.86/202.42 [2019-03-28 12:47:55,117 WARN L188 SmtUtils]: Spent 937.00 ms on a formula simplification that was a NOOP. DAG size: 55 228.86/202.42 [2019-03-28 12:48:05,846 WARN L188 SmtUtils]: Spent 1.88 s on a formula simplification that was a NOOP. DAG size: 43 228.86/202.42 [2019-03-28 12:48:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 228.86/202.42 [2019-03-28 12:48:18,508 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 228.86/202.42 [2019-03-28 12:48:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 228.86/202.42 [2019-03-28 12:48:18,522 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 228.86/202.42 [2019-03-28 12:48:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 228.86/202.42 [2019-03-28 12:48:18,534 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 228.86/202.42 [2019-03-28 12:48:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 228.86/202.42 [2019-03-28 12:48:18,547 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 228.86/202.42 [2019-03-28 12:48:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 228.86/202.42 [2019-03-28 12:48:18,559 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 228.86/202.42 [2019-03-28 12:48:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 228.86/202.42 [2019-03-28 12:48:18,570 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 228.86/202.42 [2019-03-28 12:48:18,570 INFO L98 LoopCannibalizer]: 37 predicates before loop cannibalization 37 predicates after loop cannibalization 228.86/202.42 [2019-03-28 12:48:18,571 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 37 loop predicates 228.86/202.42 [2019-03-28 12:48:18,571 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 19 transitions. cyclomatic complexity: 7 Second operand 10 states. 228.86/202.42 [2019-03-28 12:48:24,819 WARN L188 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 75 228.86/202.42 [2019-03-28 12:48:27,191 WARN L188 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 114 DAG size of output: 77 228.86/202.42 [2019-03-28 12:48:27,656 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 39 228.86/202.42 [2019-03-28 12:48:28,086 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 42 228.86/202.42 [2019-03-28 12:48:29,694 WARN L188 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 25 228.86/202.42 [2019-03-28 12:48:31,042 WARN L188 SmtUtils]: Spent 973.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 22 228.86/202.42 [2019-03-28 12:48:31,351 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 19 transitions. cyclomatic complexity: 7. Second operand 10 states. Result 48 states and 55 transitions. Complement of second has 43 states. 228.86/202.42 [2019-03-28 12:48:31,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 2 stem states 20 non-accepting loop states 1 accepting loop states 228.86/202.42 [2019-03-28 12:48:31,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 228.86/202.42 [2019-03-28 12:48:31,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 42 transitions. 228.86/202.42 [2019-03-28 12:48:31,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 42 transitions. Stem has 5 letters. Loop has 8 letters. 228.86/202.42 [2019-03-28 12:48:31,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. 228.86/202.42 [2019-03-28 12:48:31,353 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted 228.86/202.42 [2019-03-28 12:48:31,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 228.86/202.42 [2019-03-28 12:48:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 228.86/202.42 [2019-03-28 12:48:31,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 12 conjunts are in the unsatisfiable core 228.86/202.42 [2019-03-28 12:48:31,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... 228.86/202.42 [2019-03-28 12:48:31,407 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 228.86/202.42 [2019-03-28 12:48:31,408 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 27 228.86/202.42 [2019-03-28 12:48:31,408 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 228.86/202.42 [2019-03-28 12:48:31,415 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 228.86/202.42 [2019-03-28 12:48:31,416 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 228.86/202.42 [2019-03-28 12:48:31,416 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:17 228.86/202.42 [2019-03-28 12:48:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 228.86/202.42 [2019-03-28 12:48:31,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 16 conjunts are in the unsatisfiable core 228.86/202.42 [2019-03-28 12:48:31,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... 228.86/202.42 [2019-03-28 12:48:31,660 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 228.86/202.42 [2019-03-28 12:48:31,837 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 75 228.86/202.42 [2019-03-28 12:48:31,839 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.42 [2019-03-28 12:48:31,862 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 88 228.86/202.42 [2019-03-28 12:48:31,864 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.42 [2019-03-28 12:48:31,888 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 82 228.86/202.42 [2019-03-28 12:48:31,889 INFO L427 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.42 [2019-03-28 12:48:31,915 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 71 228.86/202.42 [2019-03-28 12:48:31,917 INFO L427 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.42 [2019-03-28 12:48:31,943 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 81 228.86/202.42 [2019-03-28 12:48:31,945 INFO L427 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.42 [2019-03-28 12:48:31,970 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 71 228.86/202.42 [2019-03-28 12:48:31,971 INFO L427 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.42 [2019-03-28 12:48:31,998 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 75 228.86/202.42 [2019-03-28 12:48:32,000 INFO L427 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.42 [2019-03-28 12:48:32,026 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 71 228.86/202.42 [2019-03-28 12:48:32,028 INFO L427 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.42 [2019-03-28 12:48:32,042 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 71 228.86/202.42 [2019-03-28 12:48:32,043 INFO L427 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.42 [2019-03-28 12:48:32,399 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 100 228.86/202.42 [2019-03-28 12:48:32,399 INFO L497 ElimStorePlain]: treesize reduction 293, result has 61.0 percent of original size 228.86/202.42 [2019-03-28 12:48:32,404 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. 228.86/202.42 [2019-03-28 12:48:32,404 INFO L217 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:972, output treesize:423 228.86/202.42 [2019-03-28 12:48:32,600 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 71 228.86/202.42 [2019-03-28 12:48:32,740 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 75 228.86/202.42 [2019-03-28 12:48:32,742 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.42 [2019-03-28 12:48:32,762 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 71 228.86/202.42 [2019-03-28 12:48:32,764 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.42 [2019-03-28 12:48:32,773 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 71 228.86/202.42 [2019-03-28 12:48:32,774 INFO L427 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 228.86/202.42 [2019-03-28 12:48:32,855 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 228.86/202.42 [2019-03-28 12:48:32,857 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. 228.86/202.42 [2019-03-28 12:48:32,857 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:268, output treesize:207 228.86/202.42 [2019-03-28 12:48:33,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 228.86/202.42 [2019-03-28 12:48:33,113 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates 228.86/202.42 [2019-03-28 12:48:33,113 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 19 transitions. cyclomatic complexity: 7 Second operand 10 states. 228.86/202.42 [2019-03-28 12:48:33,476 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 19 transitions. cyclomatic complexity: 7. Second operand 10 states. Result 21 states and 28 transitions. Complement of second has 17 states. 228.86/202.42 [2019-03-28 12:48:33,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states 228.86/202.42 [2019-03-28 12:48:33,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 228.86/202.42 [2019-03-28 12:48:33,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 28 transitions. 228.86/202.42 [2019-03-28 12:48:33,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 28 transitions. Stem has 5 letters. Loop has 8 letters. 228.86/202.42 [2019-03-28 12:48:33,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. 228.86/202.42 [2019-03-28 12:48:33,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 28 transitions. Stem has 13 letters. Loop has 8 letters. 228.86/202.42 [2019-03-28 12:48:33,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. 228.86/202.42 [2019-03-28 12:48:33,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 28 transitions. Stem has 5 letters. Loop has 16 letters. 228.86/202.42 [2019-03-28 12:48:33,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. 228.86/202.42 [2019-03-28 12:48:33,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. 228.86/202.42 [2019-03-28 12:48:33,484 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 228.86/202.42 [2019-03-28 12:48:33,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. 228.86/202.42 [2019-03-28 12:48:33,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 228.86/202.42 [2019-03-28 12:48:33,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 228.86/202.42 [2019-03-28 12:48:33,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 228.86/202.42 [2019-03-28 12:48:33,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 228.86/202.42 [2019-03-28 12:48:33,485 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 228.86/202.42 [2019-03-28 12:48:33,485 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 228.86/202.42 [2019-03-28 12:48:33,485 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 228.86/202.42 [2019-03-28 12:48:33,485 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 228.86/202.42 [2019-03-28 12:48:33,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 228.86/202.42 [2019-03-28 12:48:33,485 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 228.86/202.42 [2019-03-28 12:48:33,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 228.86/202.42 [2019-03-28 12:48:33,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:48:33 BasicIcfg 228.86/202.42 [2019-03-28 12:48:33,492 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 228.86/202.42 [2019-03-28 12:48:33,492 INFO L168 Benchmark]: Toolchain (without parser) took 198157.82 ms. Allocated memory was 649.6 MB in the beginning and 970.5 MB in the end (delta: 320.9 MB). Free memory was 563.5 MB in the beginning and 745.0 MB in the end (delta: -181.4 MB). Peak memory consumption was 139.4 MB. Max. memory is 50.3 GB. 228.86/202.42 [2019-03-28 12:48:33,493 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 584.3 MB. There was no memory consumed. Max. memory is 50.3 GB. 228.86/202.42 [2019-03-28 12:48:33,493 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.00 ms. Allocated memory was 649.6 MB in the beginning and 683.7 MB in the end (delta: 34.1 MB). Free memory was 563.5 MB in the beginning and 650.5 MB in the end (delta: -87.0 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 228.86/202.42 [2019-03-28 12:48:33,494 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.38 ms. Allocated memory is still 683.7 MB. Free memory was 650.5 MB in the beginning and 647.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. 228.86/202.42 [2019-03-28 12:48:33,494 INFO L168 Benchmark]: Boogie Preprocessor took 25.05 ms. Allocated memory is still 683.7 MB. Free memory was 647.7 MB in the beginning and 645.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. 228.86/202.42 [2019-03-28 12:48:33,495 INFO L168 Benchmark]: RCFGBuilder took 398.42 ms. Allocated memory is still 683.7 MB. Free memory was 645.5 MB in the beginning and 623.3 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 50.3 GB. 228.86/202.42 [2019-03-28 12:48:33,495 INFO L168 Benchmark]: BlockEncodingV2 took 145.04 ms. Allocated memory is still 683.7 MB. Free memory was 623.3 MB in the beginning and 611.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 50.3 GB. 228.86/202.42 [2019-03-28 12:48:33,495 INFO L168 Benchmark]: TraceAbstraction took 1473.25 ms. Allocated memory is still 683.7 MB. Free memory was 611.4 MB in the beginning and 456.9 MB in the end (delta: 154.4 MB). Peak memory consumption was 154.4 MB. Max. memory is 50.3 GB. 228.86/202.42 [2019-03-28 12:48:33,497 INFO L168 Benchmark]: BuchiAutomizer took 195762.14 ms. Allocated memory was 683.7 MB in the beginning and 970.5 MB in the end (delta: 286.8 MB). Free memory was 456.9 MB in the beginning and 745.0 MB in the end (delta: -288.0 MB). There was no memory consumed. Max. memory is 50.3 GB. 228.86/202.42 [2019-03-28 12:48:33,500 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 228.86/202.42 --- Results --- 228.86/202.42 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 228.86/202.42 - StatisticsResult: Initial Icfg 228.86/202.42 46 locations, 47 edges 228.86/202.42 - StatisticsResult: Encoded RCFG 228.86/202.42 35 locations, 64 edges 228.86/202.42 * Results from de.uni_freiburg.informatik.ultimate.core: 228.86/202.42 - StatisticsResult: Toolchain Benchmarks 228.86/202.42 Benchmark results are: 228.86/202.42 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 584.3 MB. There was no memory consumed. Max. memory is 50.3 GB. 228.86/202.42 * CACSL2BoogieTranslator took 306.00 ms. Allocated memory was 649.6 MB in the beginning and 683.7 MB in the end (delta: 34.1 MB). Free memory was 563.5 MB in the beginning and 650.5 MB in the end (delta: -87.0 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 228.86/202.42 * Boogie Procedure Inliner took 42.38 ms. Allocated memory is still 683.7 MB. Free memory was 650.5 MB in the beginning and 647.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. 228.86/202.42 * Boogie Preprocessor took 25.05 ms. Allocated memory is still 683.7 MB. Free memory was 647.7 MB in the beginning and 645.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. 228.86/202.42 * RCFGBuilder took 398.42 ms. Allocated memory is still 683.7 MB. Free memory was 645.5 MB in the beginning and 623.3 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 50.3 GB. 228.86/202.42 * BlockEncodingV2 took 145.04 ms. Allocated memory is still 683.7 MB. Free memory was 623.3 MB in the beginning and 611.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 50.3 GB. 228.86/202.42 * TraceAbstraction took 1473.25 ms. Allocated memory is still 683.7 MB. Free memory was 611.4 MB in the beginning and 456.9 MB in the end (delta: 154.4 MB). Peak memory consumption was 154.4 MB. Max. memory is 50.3 GB. 228.86/202.42 * BuchiAutomizer took 195762.14 ms. Allocated memory was 683.7 MB in the beginning and 970.5 MB in the end (delta: 286.8 MB). Free memory was 456.9 MB in the beginning and 745.0 MB in the end (delta: -288.0 MB). There was no memory consumed. Max. memory is 50.3 GB. 228.86/202.42 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #length 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #length 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #length 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #length 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #length 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #length 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 - GenericResult: Unfinished Backtranslation 228.86/202.42 unknown boogie variable #memory_int 228.86/202.42 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 228.86/202.42 - PositiveResult [Line: 14]: pointer dereference always succeeds 228.86/202.42 For all program executions holds that pointer dereference always succeeds at this location 228.86/202.42 - PositiveResult [Line: 16]: pointer dereference always succeeds 228.86/202.42 For all program executions holds that pointer dereference always succeeds at this location 228.86/202.42 - PositiveResult [Line: 14]: pointer dereference always succeeds 228.86/202.42 For all program executions holds that pointer dereference always succeeds at this location 228.86/202.42 - PositiveResult [Line: 14]: pointer dereference always succeeds 228.86/202.42 For all program executions holds that pointer dereference always succeeds at this location 228.86/202.42 - PositiveResult [Line: 9]: pointer dereference always succeeds 228.86/202.42 For all program executions holds that pointer dereference always succeeds at this location 228.86/202.42 - PositiveResult [Line: 16]: pointer dereference always succeeds 228.86/202.42 For all program executions holds that pointer dereference always succeeds at this location 228.86/202.42 - PositiveResult [Line: 10]: pointer dereference always succeeds 228.86/202.42 For all program executions holds that pointer dereference always succeeds at this location 228.86/202.42 - PositiveResult [Line: 14]: pointer dereference always succeeds 228.86/202.42 For all program executions holds that pointer dereference always succeeds at this location 228.86/202.42 - PositiveResult [Line: 9]: pointer dereference always succeeds 228.86/202.42 For all program executions holds that pointer dereference always succeeds at this location 228.86/202.42 - PositiveResult [Line: 15]: pointer dereference always succeeds 228.86/202.42 For all program executions holds that pointer dereference always succeeds at this location 228.86/202.42 - PositiveResult [Line: 10]: pointer dereference always succeeds 228.86/202.42 For all program executions holds that pointer dereference always succeeds at this location 228.86/202.42 - PositiveResult [Line: 14]: pointer dereference always succeeds 228.86/202.42 For all program executions holds that pointer dereference always succeeds at this location 228.86/202.42 - PositiveResult [Line: 15]: pointer dereference always succeeds 228.86/202.42 For all program executions holds that pointer dereference always succeeds at this location 228.86/202.42 - PositiveResult [Line: 11]: pointer dereference always succeeds 228.86/202.42 For all program executions holds that pointer dereference always succeeds at this location 228.86/202.42 - PositiveResult [Line: 13]: pointer dereference always succeeds 228.86/202.42 For all program executions holds that pointer dereference always succeeds at this location 228.86/202.42 - PositiveResult [Line: 15]: pointer dereference always succeeds 228.86/202.42 For all program executions holds that pointer dereference always succeeds at this location 228.86/202.42 - PositiveResult [Line: 11]: pointer dereference always succeeds 228.86/202.42 For all program executions holds that pointer dereference always succeeds at this location 228.86/202.42 - PositiveResult [Line: 16]: pointer dereference always succeeds 228.86/202.42 For all program executions holds that pointer dereference always succeeds at this location 228.86/202.42 - PositiveResult [Line: 13]: pointer dereference always succeeds 228.86/202.42 For all program executions holds that pointer dereference always succeeds at this location 228.86/202.42 - PositiveResult [Line: 15]: pointer dereference always succeeds 228.86/202.42 For all program executions holds that pointer dereference always succeeds at this location 228.86/202.42 - PositiveResult [Line: 16]: pointer dereference always succeeds 228.86/202.42 For all program executions holds that pointer dereference always succeeds at this location 228.86/202.42 - PositiveResult [Line: 14]: pointer dereference always succeeds 228.86/202.42 For all program executions holds that pointer dereference always succeeds at this location 228.86/202.42 - AllSpecificationsHoldResult: All specifications hold 228.86/202.42 22 specifications checked. All of them hold 228.86/202.42 - InvariantResult [Line: 13]: Loop Invariant 228.86/202.42 [2019-03-28 12:48:33,508 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 228.86/202.42 [2019-03-28 12:48:33,509 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 228.86/202.42 [2019-03-28 12:48:33,509 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 228.86/202.42 [2019-03-28 12:48:33,510 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 228.86/202.42 [2019-03-28 12:48:33,510 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 228.86/202.42 [2019-03-28 12:48:33,510 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 228.86/202.42 Derived loop invariant: (((((((z == 0 && \valid[y] == 1) && unknown-#length-unknown[z] == 4) && unknown-#length-unknown[y] == 4) && \valid[x] == 1) && x == 0) && \valid[z] == 1) && 4 == unknown-#length-unknown[x]) && y == 0 228.86/202.42 - StatisticsResult: Ultimate Automizer benchmark data 228.86/202.42 CFG has 1 procedures, 35 locations, 22 error locations. SAFE Result, 1.3s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 23 SDtfs, 215 SDslu, 5 SDs, 0 SdLazy, 276 SolverSat, 92 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 228.86/202.42 - StatisticsResult: Constructed decomposition of program 228.86/202.42 Your program was decomposed into 2 terminating modules (0 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has 3-nested ranking function (if 2 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[z][z] + 2 * unknown-#memory_int-unknown[y][y] > 0 then 2 else (if 3 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[y][y] > 0 then 1 else 0)), (if 2 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[z][z] + 2 * unknown-#memory_int-unknown[y][y] > 0 then 2 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[z][z] + 2 * unknown-#memory_int-unknown[y][y] else (if 3 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[y][y] > 0 then 3 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[y][y] else unknown-#memory_int-unknown[x][x])) and consists of 62 locations. One nondeterministic module has 3-nested ranking function (if 2 * unknown-#memory_int-unknown[y][y] + 2 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[z][z] > 0 then 2 else (if unknown-#memory_int-unknown[y][y] + 3 * unknown-#memory_int-unknown[x][x] > 0 then 1 else 0)), (if 2 * unknown-#memory_int-unknown[y][y] + 2 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[z][z] > 0 then 2 * unknown-#memory_int-unknown[y][y] + 2 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[z][z] else (if unknown-#memory_int-unknown[y][y] + 3 * unknown-#memory_int-unknown[x][x] > 0 then unknown-#memory_int-unknown[y][y] + 3 * unknown-#memory_int-unknown[x][x] else unknown-#memory_int-unknown[x][x])) and consists of 10 locations. 228.86/202.42 - StatisticsResult: Timing statistics 228.86/202.42 BüchiAutomizer plugin needed 195.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 4.2s. Construction of modules took 91.4s. Büchi inclusion checks took 99.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 110 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 1. Nontrivial modules had stage [1, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 11 SDtfs, 1620 SDslu, 111 SDs, 0 SdLazy, 4318 SolverSat, 193 SolverUnsat, 24 SolverUnknown, 0 SolverNotchecked, 91.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital452 mio100 ax100 hnf100 lsp98 ukn38 mio100 lsp41 div100 bol100 ite100 ukn100 eq188 hnf88 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 4 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 228.86/202.42 - TerminationAnalysisResult: Termination proven 228.86/202.42 Buchi Automizer proved that your program is terminating 228.86/202.42 RESULT: Ultimate proved your program to be correct! 228.86/202.42 !SESSION 2019-03-28 12:45:12.000 ----------------------------------------------- 228.86/202.42 eclipse.buildId=unknown 228.86/202.42 java.version=1.8.0_181 228.86/202.42 java.vendor=Oracle Corporation 228.86/202.42 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 228.86/202.42 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 228.86/202.42 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 228.86/202.42 228.86/202.42 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:48:33.736 228.86/202.42 !MESSAGE The workspace will exit with unsaved changes in this session. 228.86/202.42 Received shutdown request... 228.86/202.42 Ultimate: 228.86/202.42 GTK+ Version Check 228.86/202.42 EOF