./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/max05-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/reducercommutativity/max05-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d02fdead04c3e6f93d11e2edd6641f56f1584022 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 22:32:57,342 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:32:57,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:32:57,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:32:57,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:32:57,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:32:57,370 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:32:57,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:32:57,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:32:57,389 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:32:57,390 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:32:57,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:32:57,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:32:57,396 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:32:57,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:32:57,400 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:32:57,401 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:32:57,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:32:57,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:32:57,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:32:57,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:32:57,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:32:57,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:32:57,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:32:57,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:32:57,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:32:57,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:32:57,430 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:32:57,430 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:32:57,431 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:32:57,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:32:57,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:32:57,433 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:32:57,434 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:32:57,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:32:57,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:32:57,438 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:32:57,438 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:32:57,438 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:32:57,440 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:32:57,441 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:32:57,442 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-19 22:32:57,482 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:32:57,485 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:32:57,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:32:57,488 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:32:57,490 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:32:57,490 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-19 22:32:57,490 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-19 22:32:57,491 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-19 22:32:57,491 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-19 22:32:57,491 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-19 22:32:57,492 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-19 22:32:57,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:32:57,493 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:32:57,493 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 22:32:57,496 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:32:57,496 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:32:57,496 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:32:57,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-19 22:32:57,497 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-19 22:32:57,497 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-19 22:32:57,497 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:32:57,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:32:57,498 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-19 22:32:57,499 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:32:57,500 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-19 22:32:57,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:32:57,501 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:32:57,501 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-19 22:32:57,502 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:32:57,503 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:32:57,503 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-19 22:32:57,505 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-19 22:32:57,507 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d02fdead04c3e6f93d11e2edd6641f56f1584022 [2019-11-19 22:32:57,838 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:32:57,851 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:32:57,856 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:32:57,858 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:32:57,858 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:32:57,859 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max05-1.i [2019-11-19 22:32:57,931 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c219860c5/9f31dcebc5f54ab69a6fa687154303d3/FLAGc46cbccea [2019-11-19 22:32:58,407 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:32:58,408 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max05-1.i [2019-11-19 22:32:58,414 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c219860c5/9f31dcebc5f54ab69a6fa687154303d3/FLAGc46cbccea [2019-11-19 22:32:58,785 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c219860c5/9f31dcebc5f54ab69a6fa687154303d3 [2019-11-19 22:32:58,788 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:32:58,789 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:32:58,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:32:58,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:32:58,797 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:32:58,798 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:32:58" (1/1) ... [2019-11-19 22:32:58,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fed3917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:32:58, skipping insertion in model container [2019-11-19 22:32:58,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:32:58" (1/1) ... [2019-11-19 22:32:58,809 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:32:58,827 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:32:59,078 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:32:59,087 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:32:59,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:32:59,125 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:32:59,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:32:59 WrapperNode [2019-11-19 22:32:59,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:32:59,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:32:59,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:32:59,127 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:32:59,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:32:59" (1/1) ... [2019-11-19 22:32:59,217 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:32:59" (1/1) ... [2019-11-19 22:32:59,249 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:32:59,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:32:59,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:32:59,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:32:59,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:32:59" (1/1) ... [2019-11-19 22:32:59,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:32:59" (1/1) ... [2019-11-19 22:32:59,263 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:32:59" (1/1) ... [2019-11-19 22:32:59,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:32:59" (1/1) ... [2019-11-19 22:32:59,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:32:59" (1/1) ... [2019-11-19 22:32:59,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:32:59" (1/1) ... [2019-11-19 22:32:59,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:32:59" (1/1) ... [2019-11-19 22:32:59,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:32:59,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:32:59,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:32:59,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:32:59,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:32:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:32:59,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 22:32:59,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:32:59,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:32:59,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 22:32:59,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 22:32:59,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 22:32:59,716 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:32:59,717 INFO L285 CfgBuilder]: Removed 15 assume(true) statements. [2019-11-19 22:32:59,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:32:59 BoogieIcfgContainer [2019-11-19 22:32:59,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:32:59,719 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-19 22:32:59,719 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-19 22:32:59,723 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-19 22:32:59,724 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:32:59,724 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 10:32:58" (1/3) ... [2019-11-19 22:32:59,726 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d61b057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:32:59, skipping insertion in model container [2019-11-19 22:32:59,726 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:32:59,726 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:32:59" (2/3) ... [2019-11-19 22:32:59,727 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d61b057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:32:59, skipping insertion in model container [2019-11-19 22:32:59,727 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:32:59,727 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:32:59" (3/3) ... [2019-11-19 22:32:59,729 INFO L371 chiAutomizerObserver]: Analyzing ICFG max05-1.i [2019-11-19 22:32:59,769 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-19 22:32:59,769 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-19 22:32:59,769 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-19 22:32:59,769 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:32:59,769 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:32:59,770 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-19 22:32:59,770 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:32:59,770 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-19 22:32:59,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2019-11-19 22:32:59,804 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2019-11-19 22:32:59,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:32:59,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:32:59,810 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 22:32:59,810 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 22:32:59,810 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-19 22:32:59,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2019-11-19 22:32:59,813 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2019-11-19 22:32:59,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:32:59,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:32:59,814 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 22:32:59,814 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 22:32:59,821 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 7#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 30#L23-3true [2019-11-19 22:32:59,821 INFO L796 eck$LassoCheckResult]: Loop: 30#L23-3true assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 10#L23-2true main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 30#L23-3true [2019-11-19 22:32:59,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:32:59,826 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-19 22:32:59,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:32:59,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755063947] [2019-11-19 22:32:59,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:32:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:32:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:32:59,954 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:32:59,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:32:59,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-19 22:32:59,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:32:59,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235431646] [2019-11-19 22:32:59,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:32:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:32:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:32:59,974 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:32:59,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:32:59,976 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-19 22:32:59,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:32:59,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107303679] [2019-11-19 22:32:59,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:32:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:00,013 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:33:00,199 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:33:00,200 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:33:00,200 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:33:00,201 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:33:00,201 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:33:00,201 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:00,201 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:33:00,202 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:33:00,202 INFO L133 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration1_Lasso [2019-11-19 22:33:00,202 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:33:00,203 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:33:00,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:00,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:00,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:00,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:00,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:00,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:00,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:00,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:00,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:00,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:00,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:00,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:00,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:00,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:00,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:00,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:00,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:00,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:00,567 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:33:00,573 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:33:00,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:00,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:00,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:33:00,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:00,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:00,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:00,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:33:00,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:00,597 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:33:00,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:00,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:00,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:00,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:00,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:00,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:33:00,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:33:00,634 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:33:00,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:00,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:00,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:00,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:00,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:00,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:00,658 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:33:00,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:33:00,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:00,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:00,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:33:00,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:00,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:00,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:00,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:33:00,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:33:00,685 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:00,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:00,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:00,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:00,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:00,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:00,702 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:33:00,702 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:33:00,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:00,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:00,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:00,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:33:00,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:00,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:00,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:00,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:33:00,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:33:00,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:00,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:00,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:00,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:00,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:00,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:00,763 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:33:00,764 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:33:00,775 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:33:00,821 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2019-11-19 22:33:00,821 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:00,833 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:33:00,837 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 22:33:00,837 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:33:00,838 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1) = -8*ULTIMATE.start_main_~i~1 + 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 Supporting invariants [] [2019-11-19 22:33:00,850 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-19 22:33:00,861 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-19 22:33:00,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:00,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:33:00,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:33:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:00,923 WARN L253 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:33:00,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:33:00,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:00,979 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-19 22:33:00,981 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states. Second operand 3 states. [2019-11-19 22:33:01,144 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states.. Second operand 3 states. Result 84 states and 119 transitions. Complement of second has 8 states. [2019-11-19 22:33:01,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-19 22:33:01,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 22:33:01,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2019-11-19 22:33:01,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-19 22:33:01,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:33:01,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-19 22:33:01,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:33:01,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-19 22:33:01,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:33:01,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 119 transitions. [2019-11-19 22:33:01,174 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 22:33:01,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 25 states and 33 transitions. [2019-11-19 22:33:01,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-19 22:33:01,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-19 22:33:01,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2019-11-19 22:33:01,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:33:01,193 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-19 22:33:01,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2019-11-19 22:33:01,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-19 22:33:01,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-19 22:33:01,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-11-19 22:33:01,238 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-19 22:33:01,238 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-19 22:33:01,239 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-19 22:33:01,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-11-19 22:33:01,242 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 22:33:01,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:33:01,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:33:01,243 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-19 22:33:01,243 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 22:33:01,244 INFO L794 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 178#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 175#L23-3 assume !(main_~i~1 < 5); 174#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 163#L9-3 [2019-11-19 22:33:01,244 INFO L796 eck$LassoCheckResult]: Loop: 163#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 164#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 173#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 168#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 163#L9-3 [2019-11-19 22:33:01,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:01,245 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-11-19 22:33:01,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:01,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199290506] [2019-11-19 22:33:01,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:01,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:01,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199290506] [2019-11-19 22:33:01,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:33:01,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:33:01,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076159076] [2019-11-19 22:33:01,345 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:33:01,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:01,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 1 times [2019-11-19 22:33:01,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:01,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896989259] [2019-11-19 22:33:01,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:01,385 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:33:01,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:01,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:33:01,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:33:01,448 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-19 22:33:01,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:01,463 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2019-11-19 22:33:01,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:33:01,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2019-11-19 22:33:01,465 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 22:33:01,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2019-11-19 22:33:01,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-19 22:33:01,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-19 22:33:01,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2019-11-19 22:33:01,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:33:01,468 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-19 22:33:01,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2019-11-19 22:33:01,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-11-19 22:33:01,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-19 22:33:01,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2019-11-19 22:33:01,472 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-11-19 22:33:01,472 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-11-19 22:33:01,472 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-19 22:33:01,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2019-11-19 22:33:01,473 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 22:33:01,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:33:01,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:33:01,474 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-19 22:33:01,474 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 22:33:01,475 INFO L794 eck$LassoCheckResult]: Stem: 238#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 235#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 232#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 233#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 234#L23-3 assume !(main_~i~1 < 5); 231#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 220#L9-3 [2019-11-19 22:33:01,475 INFO L796 eck$LassoCheckResult]: Loop: 220#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 221#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 230#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 225#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 220#L9-3 [2019-11-19 22:33:01,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:01,476 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-11-19 22:33:01,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:01,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084675035] [2019-11-19 22:33:01,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:01,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:01,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084675035] [2019-11-19 22:33:01,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61469063] [2019-11-19 22:33:01,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:01,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:33:01,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:33:01,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:01,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:33:01,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-19 22:33:01,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185149968] [2019-11-19 22:33:01,585 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:33:01,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:01,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 2 times [2019-11-19 22:33:01,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:01,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714424288] [2019-11-19 22:33:01,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:01,617 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:33:01,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:01,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:33:01,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:33:01,671 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-11-19 22:33:01,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:01,696 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2019-11-19 22:33:01,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:33:01,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2019-11-19 22:33:01,698 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 22:33:01,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2019-11-19 22:33:01,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-19 22:33:01,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-19 22:33:01,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2019-11-19 22:33:01,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:33:01,702 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-19 22:33:01,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2019-11-19 22:33:01,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-11-19 22:33:01,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-19 22:33:01,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-11-19 22:33:01,709 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-19 22:33:01,709 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-19 22:33:01,709 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-19 22:33:01,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2019-11-19 22:33:01,712 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 22:33:01,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:33:01,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:33:01,713 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-11-19 22:33:01,714 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 22:33:01,714 INFO L794 eck$LassoCheckResult]: Stem: 313#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 312#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 308#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 309#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 310#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 311#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 318#L23-3 assume !(main_~i~1 < 5); 307#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 296#L9-3 [2019-11-19 22:33:01,714 INFO L796 eck$LassoCheckResult]: Loop: 296#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 297#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 306#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 301#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 296#L9-3 [2019-11-19 22:33:01,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:01,715 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2019-11-19 22:33:01,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:01,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124170987] [2019-11-19 22:33:01,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:01,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124170987] [2019-11-19 22:33:01,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9425852] [2019-11-19 22:33:01,758 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:01,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:33:01,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:33:01,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:33:01,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:33:01,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:01,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:33:01,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-19 22:33:01,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336929454] [2019-11-19 22:33:01,828 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:33:01,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:01,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 3 times [2019-11-19 22:33:01,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:01,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101081229] [2019-11-19 22:33:01,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:01,842 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:33:01,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:01,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:33:01,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:33:01,892 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 12 Second operand 6 states. [2019-11-19 22:33:01,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:01,917 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2019-11-19 22:33:01,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:33:01,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2019-11-19 22:33:01,919 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 22:33:01,920 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2019-11-19 22:33:01,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-19 22:33:01,920 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-19 22:33:01,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2019-11-19 22:33:01,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:33:01,921 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-19 22:33:01,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2019-11-19 22:33:01,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-11-19 22:33:01,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-19 22:33:01,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2019-11-19 22:33:01,924 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-19 22:33:01,924 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-19 22:33:01,924 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-19 22:33:01,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2019-11-19 22:33:01,925 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 22:33:01,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:33:01,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:33:01,926 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-11-19 22:33:01,926 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 22:33:01,929 INFO L794 eck$LassoCheckResult]: Stem: 401#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 399#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 395#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 396#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 397#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 398#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 400#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 407#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 406#L23-3 assume !(main_~i~1 < 5); 394#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 383#L9-3 [2019-11-19 22:33:01,930 INFO L796 eck$LassoCheckResult]: Loop: 383#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 384#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 393#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 388#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 383#L9-3 [2019-11-19 22:33:01,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:01,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2019-11-19 22:33:01,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:01,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482443386] [2019-11-19 22:33:01,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:02,006 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:02,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482443386] [2019-11-19 22:33:02,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439893733] [2019-11-19 22:33:02,007 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:02,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-19 22:33:02,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:33:02,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:33:02,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:33:02,067 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:02,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:33:02,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-19 22:33:02,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66826714] [2019-11-19 22:33:02,068 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:33:02,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:02,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 4 times [2019-11-19 22:33:02,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:02,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194305474] [2019-11-19 22:33:02,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:02,080 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:33:02,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:02,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:33:02,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:33:02,127 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-19 22:33:02,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:02,163 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2019-11-19 22:33:02,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:33:02,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2019-11-19 22:33:02,166 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 22:33:02,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 39 transitions. [2019-11-19 22:33:02,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-19 22:33:02,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-19 22:33:02,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2019-11-19 22:33:02,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:33:02,169 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-19 22:33:02,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2019-11-19 22:33:02,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-11-19 22:33:02,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-19 22:33:02,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-11-19 22:33:02,173 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-19 22:33:02,173 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-19 22:33:02,174 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-19 22:33:02,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2019-11-19 22:33:02,174 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 22:33:02,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:33:02,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:33:02,177 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-11-19 22:33:02,177 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 22:33:02,177 INFO L794 eck$LassoCheckResult]: Stem: 501#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 497#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 493#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 494#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 495#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 496#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 498#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 507#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 506#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 505#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 504#L23-3 assume !(main_~i~1 < 5); 492#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 481#L9-3 [2019-11-19 22:33:02,177 INFO L796 eck$LassoCheckResult]: Loop: 481#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 482#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 491#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 486#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 481#L9-3 [2019-11-19 22:33:02,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:02,178 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2019-11-19 22:33:02,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:02,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977840566] [2019-11-19 22:33:02,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:02,259 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:02,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977840566] [2019-11-19 22:33:02,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996195484] [2019-11-19 22:33:02,260 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:02,311 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 22:33:02,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:33:02,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:33:02,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:33:02,325 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:02,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:33:02,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-19 22:33:02,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212852839] [2019-11-19 22:33:02,327 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:33:02,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:02,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 5 times [2019-11-19 22:33:02,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:02,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967161483] [2019-11-19 22:33:02,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:02,338 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:33:02,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:02,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:33:02,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:33:02,397 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand 8 states. [2019-11-19 22:33:02,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:02,438 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-11-19 22:33:02,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 22:33:02,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2019-11-19 22:33:02,441 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 22:33:02,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 40 transitions. [2019-11-19 22:33:02,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-19 22:33:02,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-19 22:33:02,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2019-11-19 22:33:02,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:33:02,444 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-11-19 22:33:02,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2019-11-19 22:33:02,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-19 22:33:02,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-19 22:33:02,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-11-19 22:33:02,449 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-11-19 22:33:02,450 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-11-19 22:33:02,450 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-19 22:33:02,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2019-11-19 22:33:02,451 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 22:33:02,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:33:02,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:33:02,453 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2019-11-19 22:33:02,453 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 22:33:02,453 INFO L794 eck$LassoCheckResult]: Stem: 606#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 605#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 601#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 602#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 603#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 604#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 617#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 616#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 615#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 614#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 613#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 612#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 611#L23-3 assume !(main_~i~1 < 5); 600#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 589#L9-3 [2019-11-19 22:33:02,454 INFO L796 eck$LassoCheckResult]: Loop: 589#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 590#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 599#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 594#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 589#L9-3 [2019-11-19 22:33:02,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:02,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2019-11-19 22:33:02,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:02,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282283138] [2019-11-19 22:33:02,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:02,547 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:33:02,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:02,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 6 times [2019-11-19 22:33:02,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:02,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447205596] [2019-11-19 22:33:02,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:02,562 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:33:02,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:02,565 INFO L82 PathProgramCache]: Analyzing trace with hash -743539014, now seen corresponding path program 1 times [2019-11-19 22:33:02,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:02,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158565832] [2019-11-19 22:33:02,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:02,633 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:33:03,175 WARN L191 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 101 [2019-11-19 22:33:03,282 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:33:03,282 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:33:03,283 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:33:03,283 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:33:03,283 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:33:03,283 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:03,284 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:33:03,284 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:33:03,284 INFO L133 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration7_Lasso [2019-11-19 22:33:03,284 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:33:03,284 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:33:03,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:03,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:03,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:03,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:03,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:03,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:03,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:03,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:03,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:03,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:03,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:03,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:03,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:03,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:03,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:03,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:03,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:03,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:03,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:03,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:03,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:03,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:03,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:03,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:03,743 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:33:03,743 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:03,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:03,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:03,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:33:03,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:03,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:03,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:03,756 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:33:03,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:33:03,757 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:03,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:03,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:03,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:33:03,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:03,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:03,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:03,766 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:33:03,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:33:03,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:03,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:03,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:03,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:33:03,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:03,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:03,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:03,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:33:03,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:33:03,787 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:03,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:03,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:03,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:33:03,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:03,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:03,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:03,799 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:33:03,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:33:03,800 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:03,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:03,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:03,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:03,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:03,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:03,819 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:33:03,819 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:33:03,828 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:03,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:03,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:03,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:33:03,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:03,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:03,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:03,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:33:03,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:33:03,853 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:03,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:03,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:03,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:33:03,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:03,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:03,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:03,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:33:03,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:33:03,873 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:03,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:03,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:03,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:33:03,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:03,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:03,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:03,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:33:03,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:33:03,889 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:33:03,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:03,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:03,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:33:03,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:03,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:03,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:03,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:33:03,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:03,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:03,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:03,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:03,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:33:03,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:03,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:03,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:03,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:33:03,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:33:03,931 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:33:03,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:03,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:03,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:03,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:03,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:03,943 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:33:03,943 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:33:03,947 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:33:03,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:03,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:03,966 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:33:03,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:03,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:03,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:03,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:33:03,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:03,970 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:33:03,986 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:03,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:03,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:33:03,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:03,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:03,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:03,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:33:03,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:03,991 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:33:04,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:04,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:04,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:33:04,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:04,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:04,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:04,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:33:04,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:04,005 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:33:04,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:04,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:04,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:33:04,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:04,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:04,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:04,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:33:04,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:04,019 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:33:04,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:04,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:04,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:33:04,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:04,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:04,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:04,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:33:04,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:04,032 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:33:04,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:04,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:04,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:33:04,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:04,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:04,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:04,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:33:04,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:04,044 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:33:04,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:04,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:04,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:04,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:04,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:04,060 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:33:04,060 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:04,074 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:33:04,119 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-19 22:33:04,119 INFO L444 ModelExtractionUtils]: 2 out of 22 variables were initially zero. Simplification set additionally 17 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:04,125 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:33:04,127 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 22:33:04,128 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:33:04,128 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_2) = -8*ULTIMATE.start_max_~i~0 + 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_2 Supporting invariants [] [2019-11-19 22:33:04,137 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2019-11-19 22:33:04,140 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-19 22:33:04,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:04,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:33:04,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:33:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:04,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:33:04,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:33:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:04,212 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-19 22:33:04,212 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-19 22:33:04,251 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 39 states and 50 transitions. Complement of second has 7 states. [2019-11-19 22:33:04,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-19 22:33:04,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 22:33:04,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-11-19 22:33:04,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 14 letters. Loop has 4 letters. [2019-11-19 22:33:04,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:33:04,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 18 letters. Loop has 4 letters. [2019-11-19 22:33:04,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:33:04,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 14 letters. Loop has 8 letters. [2019-11-19 22:33:04,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:33:04,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2019-11-19 22:33:04,256 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 22:33:04,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 34 states and 42 transitions. [2019-11-19 22:33:04,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-19 22:33:04,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-19 22:33:04,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2019-11-19 22:33:04,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:33:04,258 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-11-19 22:33:04,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2019-11-19 22:33:04,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-19 22:33:04,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-19 22:33:04,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2019-11-19 22:33:04,262 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-11-19 22:33:04,262 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-11-19 22:33:04,262 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-19 22:33:04,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2019-11-19 22:33:04,263 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 22:33:04,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:33:04,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:33:04,264 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:33:04,264 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 22:33:04,265 INFO L794 eck$LassoCheckResult]: Stem: 776#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 773#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 769#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 770#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 771#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 772#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 785#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 784#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 783#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 782#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 781#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 780#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 779#L23-3 assume !(main_~i~1 < 5); 768#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 756#L9-3 assume !(max_~i~0 < 5); 752#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 753#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 777#L9-8 [2019-11-19 22:33:04,265 INFO L796 eck$LassoCheckResult]: Loop: 777#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 763#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 754#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 755#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 777#L9-8 [2019-11-19 22:33:04,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:04,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581251, now seen corresponding path program 1 times [2019-11-19 22:33:04,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:04,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747585570] [2019-11-19 22:33:04,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:04,297 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-19 22:33:04,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747585570] [2019-11-19 22:33:04,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:33:04,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:33:04,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740000625] [2019-11-19 22:33:04,299 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:33:04,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:04,299 INFO L82 PathProgramCache]: Analyzing trace with hash 2373478, now seen corresponding path program 1 times [2019-11-19 22:33:04,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:04,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344836655] [2019-11-19 22:33:04,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:04,307 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:33:04,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:04,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:33:04,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:33:04,357 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-19 22:33:04,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:04,394 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2019-11-19 22:33:04,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:33:04,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2019-11-19 22:33:04,396 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 22:33:04,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 55 transitions. [2019-11-19 22:33:04,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-19 22:33:04,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-19 22:33:04,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 55 transitions. [2019-11-19 22:33:04,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:33:04,398 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2019-11-19 22:33:04,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 55 transitions. [2019-11-19 22:33:04,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2019-11-19 22:33:04,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-19 22:33:04,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2019-11-19 22:33:04,401 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-11-19 22:33:04,402 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-11-19 22:33:04,402 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-19 22:33:04,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2019-11-19 22:33:04,403 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 22:33:04,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:33:04,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:33:04,404 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:33:04,404 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 22:33:04,404 INFO L794 eck$LassoCheckResult]: Stem: 859#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 858#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 854#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 855#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 856#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 857#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 871#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 870#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 869#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 868#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 867#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 866#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 865#L23-3 assume !(main_~i~1 < 5); 853#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 841#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 842#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 852#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 847#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 843#L9-3 assume !(max_~i~0 < 5); 837#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 838#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 862#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 848#L10-3 [2019-11-19 22:33:04,405 INFO L796 eck$LassoCheckResult]: Loop: 848#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 839#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 840#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 864#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 848#L10-3 [2019-11-19 22:33:04,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:04,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1336698829, now seen corresponding path program 1 times [2019-11-19 22:33:04,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:04,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387016424] [2019-11-19 22:33:04,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:04,458 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-19 22:33:04,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387016424] [2019-11-19 22:33:04,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454743899] [2019-11-19 22:33:04,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:04,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:33:04,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:33:04,535 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-19 22:33:04,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:33:04,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-19 22:33:04,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603652766] [2019-11-19 22:33:04,537 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:33:04,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:04,538 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 2 times [2019-11-19 22:33:04,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:04,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414121057] [2019-11-19 22:33:04,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:04,549 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:33:04,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:04,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:33:04,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:33:04,613 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-11-19 22:33:04,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:04,663 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2019-11-19 22:33:04,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:33:04,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 70 transitions. [2019-11-19 22:33:04,665 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 22:33:04,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 70 transitions. [2019-11-19 22:33:04,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-11-19 22:33:04,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-11-19 22:33:04,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 70 transitions. [2019-11-19 22:33:04,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:33:04,667 INFO L688 BuchiCegarLoop]: Abstraction has 57 states and 70 transitions. [2019-11-19 22:33:04,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 70 transitions. [2019-11-19 22:33:04,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2019-11-19 22:33:04,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-19 22:33:04,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-11-19 22:33:04,671 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-11-19 22:33:04,671 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-11-19 22:33:04,671 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-19 22:33:04,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 52 transitions. [2019-11-19 22:33:04,672 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 22:33:04,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:33:04,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:33:04,673 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:33:04,673 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 22:33:04,674 INFO L794 eck$LassoCheckResult]: Stem: 1025#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1023#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1019#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1020#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1021#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1022#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1024#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1040#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1039#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1038#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1036#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1035#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1034#L23-3 assume !(main_~i~1 < 5); 1018#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1004#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1005#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1037#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1011#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1006#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1007#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1016#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1017#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1032#L9-3 assume !(max_~i~0 < 5); 1000#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1001#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1029#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1042#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1041#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1030#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1028#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1012#L10-3 [2019-11-19 22:33:04,674 INFO L796 eck$LassoCheckResult]: Loop: 1012#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1002#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1003#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1033#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1012#L10-3 [2019-11-19 22:33:04,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:04,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1525547091, now seen corresponding path program 1 times [2019-11-19 22:33:04,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:04,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039200182] [2019-11-19 22:33:04,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:04,732 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-19 22:33:04,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039200182] [2019-11-19 22:33:04,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31296331] [2019-11-19 22:33:04,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:04,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:33:04,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:33:04,804 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-19 22:33:04,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:33:04,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-19 22:33:04,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243681822] [2019-11-19 22:33:04,806 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:33:04,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:04,806 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 3 times [2019-11-19 22:33:04,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:04,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169854860] [2019-11-19 22:33:04,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:04,821 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:33:04,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:04,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:33:04,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:33:04,893 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. cyclomatic complexity: 14 Second operand 6 states. [2019-11-19 22:33:04,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:04,976 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2019-11-19 22:33:04,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:33:04,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 85 transitions. [2019-11-19 22:33:04,979 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 22:33:04,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 85 transitions. [2019-11-19 22:33:04,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-11-19 22:33:04,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2019-11-19 22:33:04,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 85 transitions. [2019-11-19 22:33:04,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:33:04,981 INFO L688 BuchiCegarLoop]: Abstraction has 69 states and 85 transitions. [2019-11-19 22:33:04,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 85 transitions. [2019-11-19 22:33:04,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2019-11-19 22:33:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-19 22:33:04,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2019-11-19 22:33:04,986 INFO L711 BuchiCegarLoop]: Abstraction has 51 states and 62 transitions. [2019-11-19 22:33:04,986 INFO L591 BuchiCegarLoop]: Abstraction has 51 states and 62 transitions. [2019-11-19 22:33:04,986 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-19 22:33:04,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 62 transitions. [2019-11-19 22:33:04,987 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 22:33:04,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:33:04,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:33:04,988 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:33:04,988 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 22:33:04,989 INFO L794 eck$LassoCheckResult]: Stem: 1235#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1232#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1228#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1229#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1230#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1231#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1253#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1252#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1251#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1250#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1249#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1248#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1247#L23-3 assume !(main_~i~1 < 5); 1227#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1212#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1213#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1225#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1226#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1214#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1215#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1258#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1219#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1220#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1242#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1257#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1243#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1241#L9-3 assume !(max_~i~0 < 5); 1208#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1209#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1236#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1237#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1256#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1238#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1239#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1221#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1210#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1211#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1255#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1245#L10-3 [2019-11-19 22:33:04,989 INFO L796 eck$LassoCheckResult]: Loop: 1245#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1254#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1246#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1244#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1245#L10-3 [2019-11-19 22:33:04,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:04,989 INFO L82 PathProgramCache]: Analyzing trace with hash 452444531, now seen corresponding path program 2 times [2019-11-19 22:33:04,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:04,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878520577] [2019-11-19 22:33:04,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:05,055 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-19 22:33:05,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878520577] [2019-11-19 22:33:05,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611213676] [2019-11-19 22:33:05,056 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:05,121 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:33:05,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:33:05,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:33:05,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:33:05,139 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-19 22:33:05,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:33:05,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-19 22:33:05,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804191085] [2019-11-19 22:33:05,140 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:33:05,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:05,141 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 4 times [2019-11-19 22:33:05,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:05,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239246215] [2019-11-19 22:33:05,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:05,149 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:33:05,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:05,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:33:05,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:33:05,223 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. cyclomatic complexity: 16 Second operand 7 states. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Exception during sending of exit command (exit): Broken pipe [2019-11-19 22:33:05,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:05,371 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2019-11-19 22:33:05,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:33:05,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 100 transitions. [2019-11-19 22:33:05,372 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 22:33:05,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 81 states and 100 transitions. [2019-11-19 22:33:05,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2019-11-19 22:33:05,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2019-11-19 22:33:05,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 100 transitions. [2019-11-19 22:33:05,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:33:05,375 INFO L688 BuchiCegarLoop]: Abstraction has 81 states and 100 transitions. [2019-11-19 22:33:05,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 100 transitions. [2019-11-19 22:33:05,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 59. [2019-11-19 22:33:05,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-19 22:33:05,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2019-11-19 22:33:05,378 INFO L711 BuchiCegarLoop]: Abstraction has 59 states and 72 transitions. [2019-11-19 22:33:05,378 INFO L591 BuchiCegarLoop]: Abstraction has 59 states and 72 transitions. [2019-11-19 22:33:05,378 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-19 22:33:05,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 72 transitions. [2019-11-19 22:33:05,379 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 22:33:05,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:33:05,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:33:05,380 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:33:05,381 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 22:33:05,381 INFO L794 eck$LassoCheckResult]: Stem: 1486#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1483#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1479#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1480#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1481#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1482#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1502#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1501#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1500#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1499#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1498#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1497#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1496#L23-3 assume !(main_~i~1 < 5); 1478#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1465#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1466#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1477#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1472#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1467#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1468#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1518#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1516#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1514#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1512#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1510#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1508#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1506#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1491#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1504#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1492#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1490#L9-3 assume !(max_~i~0 < 5); 1461#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1462#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1487#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1473#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1463#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1464#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1488#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1519#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1517#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1515#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1513#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1511#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1509#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1507#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1505#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1494#L10-3 [2019-11-19 22:33:05,381 INFO L796 eck$LassoCheckResult]: Loop: 1494#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1503#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1495#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1493#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1494#L10-3 [2019-11-19 22:33:05,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:05,381 INFO L82 PathProgramCache]: Analyzing trace with hash 2023971731, now seen corresponding path program 3 times [2019-11-19 22:33:05,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:05,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848212337] [2019-11-19 22:33:05,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:05,429 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-19 22:33:05,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848212337] [2019-11-19 22:33:05,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636430179] [2019-11-19 22:33:05,430 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:05,507 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-19 22:33:05,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:33:05,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-19 22:33:05,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:33:05,549 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-19 22:33:05,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:33:05,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 10 [2019-11-19 22:33:05,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791683752] [2019-11-19 22:33:05,551 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:33:05,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:05,551 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 5 times [2019-11-19 22:33:05,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:05,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358715774] [2019-11-19 22:33:05,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:05,557 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:33:05,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:05,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:33:05,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:33:05,620 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. cyclomatic complexity: 18 Second operand 10 states. [2019-11-19 22:33:05,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:05,806 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2019-11-19 22:33:05,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:33:05,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 103 transitions. [2019-11-19 22:33:05,807 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 22:33:05,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 103 transitions. [2019-11-19 22:33:05,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2019-11-19 22:33:05,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-11-19 22:33:05,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 103 transitions. [2019-11-19 22:33:05,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:33:05,809 INFO L688 BuchiCegarLoop]: Abstraction has 84 states and 103 transitions. [2019-11-19 22:33:05,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 103 transitions. [2019-11-19 22:33:05,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 67. [2019-11-19 22:33:05,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-19 22:33:05,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2019-11-19 22:33:05,813 INFO L711 BuchiCegarLoop]: Abstraction has 67 states and 82 transitions. [2019-11-19 22:33:05,813 INFO L591 BuchiCegarLoop]: Abstraction has 67 states and 82 transitions. [2019-11-19 22:33:05,813 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-19 22:33:05,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 82 transitions. [2019-11-19 22:33:05,814 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 22:33:05,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:33:05,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:33:05,815 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:33:05,815 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 22:33:05,816 INFO L794 eck$LassoCheckResult]: Stem: 1786#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1785#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1781#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1782#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1783#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1784#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1810#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1808#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1806#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1804#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1802#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1800#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1799#L23-3 assume !(main_~i~1 < 5); 1780#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1766#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1767#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1828#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1827#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1768#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1769#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1779#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1773#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1774#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1826#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1825#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1824#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1823#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1822#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1820#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1818#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1816#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1793#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1813#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1794#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1792#L9-3 assume !(max_~i~0 < 5); 1762#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1763#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1789#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1775#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1764#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1765#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1790#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1821#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1819#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1817#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1815#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1814#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1812#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1811#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1809#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1807#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1805#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1803#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1801#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1796#L10-3 [2019-11-19 22:33:05,816 INFO L796 eck$LassoCheckResult]: Loop: 1796#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1798#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1797#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1795#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1796#L10-3 [2019-11-19 22:33:05,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:05,816 INFO L82 PathProgramCache]: Analyzing trace with hash 669208243, now seen corresponding path program 4 times [2019-11-19 22:33:05,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:05,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769862882] [2019-11-19 22:33:05,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:05,898 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:33:05,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:05,898 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 6 times [2019-11-19 22:33:05,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:05,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886965994] [2019-11-19 22:33:05,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:05,905 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:33:05,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:05,906 INFO L82 PathProgramCache]: Analyzing trace with hash -746698386, now seen corresponding path program 1 times [2019-11-19 22:33:05,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:05,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171120483] [2019-11-19 22:33:05,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:06,064 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-19 22:33:06,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171120483] [2019-11-19 22:33:06,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:33:06,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-19 22:33:06,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979326824] [2019-11-19 22:33:06,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:06,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:33:06,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:33:06,127 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. cyclomatic complexity: 20 Second operand 10 states. [2019-11-19 22:33:06,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:06,355 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2019-11-19 22:33:06,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:33:06,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 100 transitions. [2019-11-19 22:33:06,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 22:33:06,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 62 states and 73 transitions. [2019-11-19 22:33:06,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-11-19 22:33:06,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2019-11-19 22:33:06,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 73 transitions. [2019-11-19 22:33:06,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:33:06,358 INFO L688 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2019-11-19 22:33:06,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 73 transitions. [2019-11-19 22:33:06,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-19 22:33:06,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-19 22:33:06,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2019-11-19 22:33:06,365 INFO L711 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2019-11-19 22:33:06,365 INFO L591 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2019-11-19 22:33:06,365 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-19 22:33:06,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 73 transitions. [2019-11-19 22:33:06,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 22:33:06,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:33:06,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:33:06,370 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:33:06,370 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 22:33:06,370 INFO L794 eck$LassoCheckResult]: Stem: 1958#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1957#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1953#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1954#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1955#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1956#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1978#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1975#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1972#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1969#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1967#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1965#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1964#L23-3 assume !(main_~i~1 < 5); 1952#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1944#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1945#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1951#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1946#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1947#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2001#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2000#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1998#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1996#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1994#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1992#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1990#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1988#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1986#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1984#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1982#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1980#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1977#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1974#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1971#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1963#L9-3 assume !(max_~i~0 < 5); 1940#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1941#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1961#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1948#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1942#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1943#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1962#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1999#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1997#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1995#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1993#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1991#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1989#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1987#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1985#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1983#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1981#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1979#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1976#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1973#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1970#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1968#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1966#L9-8 assume !(max_~i~0 < 5); 1959#L9-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1960#L12-1 main_#t~ret9 := max_#res;main_~ret2~0 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;main_~i~2 := 0; 1949#L32-3 [2019-11-19 22:33:06,370 INFO L796 eck$LassoCheckResult]: Loop: 1949#L32-3 assume !!(main_~i~2 < 4);call main_#t~mem12 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem12, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem12; 1950#L32-2 main_#t~post11 := main_~i~2;main_~i~2 := 1 + main_#t~post11;havoc main_#t~post11; 1949#L32-3 [2019-11-19 22:33:06,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:06,371 INFO L82 PathProgramCache]: Analyzing trace with hash -260352212, now seen corresponding path program 1 times [2019-11-19 22:33:06,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:06,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131938376] [2019-11-19 22:33:06,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:06,454 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:33:06,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:06,455 INFO L82 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 1 times [2019-11-19 22:33:06,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:06,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206662778] [2019-11-19 22:33:06,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:06,460 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:33:06,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:06,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1090370322, now seen corresponding path program 1 times [2019-11-19 22:33:06,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:06,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016677355] [2019-11-19 22:33:06,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:06,508 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:33:09,460 WARN L191 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 402 DAG size of output: 285 [2019-11-19 22:33:10,154 WARN L191 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 113 [2019-11-19 22:33:10,157 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:33:10,157 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:33:10,157 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:33:10,157 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:33:10,157 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:33:10,157 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:10,157 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:33:10,157 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:33:10,157 INFO L133 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration14_Lasso [2019-11-19 22:33:10,157 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:33:10,158 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:33:10,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:10,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:10,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:10,547 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-11-19 22:33:10,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:10,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:10,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:10,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:10,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:10,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:10,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:10,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:10,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:10,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:10,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:10,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:10,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:10,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:10,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:10,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:10,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:10,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:33:11,008 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:33:11,009 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:11,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:11,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:11,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:33:11,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:11,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:11,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:11,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:33:11,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:33:11,020 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:33:11,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:11,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:11,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:33:11,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:11,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:11,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:11,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:33:11,040 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:11,041 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:33:11,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:11,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:11,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:11,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:11,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:11,054 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:33:11,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:11,059 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:33:11,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:11,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:11,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:11,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:11,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:11,077 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:33:11,077 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:11,084 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:11,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:11,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:11,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:33:11,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:11,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:11,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:11,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:33:11,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:33:11,101 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:33:11,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:11,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:11,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:33:11,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:11,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:11,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:11,109 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:33:11,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:33:11,111 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:33:11,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:11,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:11,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:11,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:11,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:11,127 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:33:11,127 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:11,133 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:33:11,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:11,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:11,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:11,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:11,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:11,144 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:33:11,144 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:33:11,149 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:11,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:11,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:11,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:33:11,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:11,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:11,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:11,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:33:11,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:33:11,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:33:11,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:11,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:11,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:11,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:11,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:11,173 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:33:11,173 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:11,176 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:11,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:11,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:11,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:11,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:11,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:11,189 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:33:11,189 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:33:11,194 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:11,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:11,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:11,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:11,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:11,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:11,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:33:11,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:33:11,210 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:11,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:11,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:11,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:33:11,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:11,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:11,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:11,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:33:11,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:33:11,223 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:11,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:33:11,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:33:11,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:33:11,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:33:11,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:33:11,237 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:33:11,238 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:33:11,256 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:33:11,301 INFO L443 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2019-11-19 22:33:11,301 INFO L444 ModelExtractionUtils]: 2 out of 22 variables were initially zero. Simplification set additionally 17 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:33:11,305 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:33:11,308 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 22:33:11,308 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:33:11,309 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~i~2) = 7*ULTIMATE.start_main_~i~1 - 10*ULTIMATE.start_main_~i~2 Supporting invariants [] [2019-11-19 22:33:11,396 INFO L297 tatePredicateManager]: 24 out of 25 supporting invariants were superfluous and have been removed [2019-11-19 22:33:11,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:11,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-19 22:33:11,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:33:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:11,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:33:11,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:33:11,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:11,888 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2019-11-19 22:33:11,888 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 73 transitions. cyclomatic complexity: 13 Second operand 9 states. [2019-11-19 22:33:11,997 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 73 transitions. cyclomatic complexity: 13. Second operand 9 states. Result 115 states and 138 transitions. Complement of second has 11 states. [2019-11-19 22:33:11,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 7 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-19 22:33:11,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-19 22:33:11,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 55 transitions. [2019-11-19 22:33:11,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 55 transitions. Stem has 60 letters. Loop has 2 letters. [2019-11-19 22:33:11,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:33:11,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 55 transitions. Stem has 62 letters. Loop has 2 letters. [2019-11-19 22:33:12,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:33:12,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 55 transitions. Stem has 60 letters. Loop has 4 letters. [2019-11-19 22:33:12,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:33:12,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 138 transitions. [2019-11-19 22:33:12,002 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 22:33:12,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 0 states and 0 transitions. [2019-11-19 22:33:12,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-19 22:33:12,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-19 22:33:12,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-19 22:33:12,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:33:12,003 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:33:12,003 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:33:12,003 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:33:12,003 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-19 22:33:12,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-19 22:33:12,003 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 22:33:12,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-19 22:33:12,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 10:33:12 BoogieIcfgContainer [2019-11-19 22:33:12,010 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-19 22:33:12,010 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:33:12,010 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:33:12,010 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:33:12,011 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:32:59" (3/4) ... [2019-11-19 22:33:12,014 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 22:33:12,014 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:33:12,016 INFO L168 Benchmark]: Toolchain (without parser) took 13226.47 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 369.6 MB). Free memory was 956.3 MB in the beginning and 1.3 GB in the end (delta: -370.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:33:12,016 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:33:12,017 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.12 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:33:12,017 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -185.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:33:12,018 INFO L168 Benchmark]: Boogie Preprocessor took 34.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:33:12,018 INFO L168 Benchmark]: RCFGBuilder took 431.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:33:12,019 INFO L168 Benchmark]: BuchiAutomizer took 12291.04 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 228.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -226.1 MB). Peak memory consumption was 2.5 MB. Max. memory is 11.5 GB. [2019-11-19 22:33:12,019 INFO L168 Benchmark]: Witness Printer took 4.23 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:33:12,022 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 335.12 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 124.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -185.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 431.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12291.04 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 228.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -226.1 MB). Peak memory consumption was 2.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.23 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (11 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -8 * i + 9 * unknown-#length-unknown[x] and consists of 5 locations. One deterministic module has affine ranking function -8 * i + 9 * unknown-#length-unknown[x] and consists of 4 locations. One deterministic module has affine ranking function 7 * i + -10 * i and consists of 10 locations. 11 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.2s and 15 iterations. TraceHistogramMax:5. Analysis of lassos took 10.0s. Construction of modules took 0.6s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 85 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 67 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 336 SDtfs, 489 SDslu, 778 SDs, 0 SdLazy, 546 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital252 mio100 ax100 hnf99 lsp95 ukn49 mio100 lsp57 div100 bol100 ite100 ukn100 eq164 hnf86 smp99 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...