./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 4ab4fc7901859c456c176827e7d5fcf9e4988b17 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:21:07,138 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:21:07,140 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:21:07,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:21:07,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:21:07,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:21:07,165 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:21:07,175 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:21:07,181 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:21:07,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:21:07,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:21:07,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:21:07,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:21:07,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:21:07,192 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:21:07,193 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:21:07,196 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:21:07,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:21:07,199 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:21:07,203 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:21:07,207 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:21:07,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:21:07,213 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:21:07,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:21:07,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:21:07,217 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:21:07,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:21:07,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:21:07,219 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:21:07,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:21:07,220 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:21:07,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:21:07,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:21:07,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:21:07,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:21:07,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:21:07,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:21:07,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:21:07,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:21:07,227 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:21:07,228 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:21:07,229 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-19 22:21:07,265 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:21:07,266 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:21:07,267 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:21:07,267 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:21:07,267 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:21:07,268 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-19 22:21:07,268 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-19 22:21:07,268 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-19 22:21:07,268 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-19 22:21:07,269 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-19 22:21:07,269 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-19 22:21:07,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:21:07,269 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 22:21:07,269 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:21:07,270 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:21:07,270 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-19 22:21:07,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-19 22:21:07,270 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-19 22:21:07,271 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:21:07,271 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-19 22:21:07,271 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:21:07,271 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-19 22:21:07,271 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:21:07,272 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:21:07,272 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-19 22:21:07,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:21:07,272 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:21:07,272 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-19 22:21:07,274 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-19 22:21:07,274 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ab4fc7901859c456c176827e7d5fcf9e4988b17 [2019-11-19 22:21:07,586 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:21:07,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:21:07,602 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:21:07,604 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:21:07,605 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:21:07,605 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca.i [2019-11-19 22:21:07,683 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a487f3278/bbd4cd3ed973464eaf05ba7ece848fb0/FLAG27a524042 [2019-11-19 22:21:08,219 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:21:08,220 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca.i [2019-11-19 22:21:08,232 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a487f3278/bbd4cd3ed973464eaf05ba7ece848fb0/FLAG27a524042 [2019-11-19 22:21:08,479 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a487f3278/bbd4cd3ed973464eaf05ba7ece848fb0 [2019-11-19 22:21:08,482 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:21:08,485 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:21:08,487 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:21:08,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:21:08,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:21:08,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:21:08" (1/1) ... [2019-11-19 22:21:08,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74d58c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:08, skipping insertion in model container [2019-11-19 22:21:08,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:21:08" (1/1) ... [2019-11-19 22:21:08,506 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:21:08,563 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:21:09,047 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:21:09,060 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:21:09,097 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:21:09,148 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:21:09,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:09 WrapperNode [2019-11-19 22:21:09,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:21:09,150 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:21:09,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:21:09,151 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:21:09,160 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:21:09" (1/1) ... [2019-11-19 22:21:09,177 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:21:09" (1/1) ... [2019-11-19 22:21:09,201 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:21:09,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:21:09,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:21:09,202 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:21:09,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:09" (1/1) ... [2019-11-19 22:21:09,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:09" (1/1) ... [2019-11-19 22:21:09,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:09" (1/1) ... [2019-11-19 22:21:09,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:09" (1/1) ... [2019-11-19 22:21:09,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:09" (1/1) ... [2019-11-19 22:21:09,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:09" (1/1) ... [2019-11-19 22:21:09,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:09" (1/1) ... [2019-11-19 22:21:09,230 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:21:09,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:21:09,231 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:21:09,231 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:21:09,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:09" (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:21:09,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 22:21:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 22:21:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 22:21:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 22:21:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:21:09,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:21:09,650 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:21:09,650 INFO L285 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-19 22:21:09,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:21:09 BoogieIcfgContainer [2019-11-19 22:21:09,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:21:09,653 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-19 22:21:09,653 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-19 22:21:09,657 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-19 22:21:09,658 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:21:09,658 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 10:21:08" (1/3) ... [2019-11-19 22:21:09,659 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a08b495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:21:09, skipping insertion in model container [2019-11-19 22:21:09,659 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:21:09,660 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:09" (2/3) ... [2019-11-19 22:21:09,660 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a08b495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:21:09, skipping insertion in model container [2019-11-19 22:21:09,660 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:21:09,661 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:21:09" (3/3) ... [2019-11-19 22:21:09,662 INFO L371 chiAutomizerObserver]: Analyzing ICFG Ben-Amram-2010LMCS-Ex2.3-alloca.i [2019-11-19 22:21:09,715 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-19 22:21:09,715 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-19 22:21:09,716 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-19 22:21:09,716 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:21:09,716 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:21:09,717 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-19 22:21:09,717 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:21:09,717 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-19 22:21:09,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-19 22:21:09,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-19 22:21:09,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:09,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:09,769 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 22:21:09,770 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-19 22:21:09,770 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-19 22:21:09,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-19 22:21:09,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-19 22:21:09,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:09,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:09,774 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 22:21:09,774 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-19 22:21:09,783 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 5#L555-2true [2019-11-19 22:21:09,784 INFO L796 eck$LassoCheckResult]: Loop: 5#L555-2true call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 6#L554-1true assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 9#L554-3true main_#t~short12 := main_#t~short10; 11#L554-4true assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 4#L554-6true assume !!main_#t~short12;havoc main_#t~short10;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem8;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 12#L555true assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 5#L555-2true [2019-11-19 22:21:09,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:09,792 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-19 22:21:09,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:09,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790910670] [2019-11-19 22:21:09,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:09,980 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:09,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:09,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 1 times [2019-11-19 22:21:09,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:09,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345750574] [2019-11-19 22:21:09,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:10,055 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:10,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:10,058 INFO L82 PathProgramCache]: Analyzing trace with hash 177626380, now seen corresponding path program 1 times [2019-11-19 22:21:10,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:10,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340594700] [2019-11-19 22:21:10,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:10,183 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:10,530 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-11-19 22:21:11,012 WARN L191 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-11-19 22:21:11,174 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-19 22:21:11,189 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:21:11,190 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:21:11,190 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:21:11,190 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:21:11,191 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:21:11,191 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,191 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:21:11,191 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:21:11,191 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca.i_Iteration1_Lasso [2019-11-19 22:21:11,191 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:21:11,192 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:21:11,222 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:21:11,227 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:21:11,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:21:11,232 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:21:11,663 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-11-19 22:21:11,823 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-11-19 22:21:11,824 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:21:11,827 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:21:11,830 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:21:11,833 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:21:11,835 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:21:11,839 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:21:11,842 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:21:11,845 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:21:11,849 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:21:11,855 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:21:11,858 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:21:11,860 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:21:11,862 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:21:11,866 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:21:11,871 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:21:11,874 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:21:11,876 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:21:11,879 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:21:12,158 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-11-19 22:21:12,584 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:21:12,595 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:21:12,604 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:21:12,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:12,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:12,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:12,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:12,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:12,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:12,614 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:21:12,618 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:21:12,631 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:21:12,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:12,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:12,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:12,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:12,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:12,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:12,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:12,637 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:12,651 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:21:12,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:12,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:12,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:12,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:12,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:12,654 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:12,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:12,655 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:12,663 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:21:12,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:12,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:12,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:12,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:12,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:12,675 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:12,686 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) [2019-11-19 22:21:12,708 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:21:12,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:12,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:12,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:12,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:12,722 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:12,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:12,730 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:21:12,747 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:21:12,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:12,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:12,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:12,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:12,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:12,760 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:12,768 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) [2019-11-19 22:21:12,787 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:21:12,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:12,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:12,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:12,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:12,805 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:12,806 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:12,817 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 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:21:12,836 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:21:12,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:12,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:12,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:12,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:12,856 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:12,856 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:12,875 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 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:12,888 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:21:12,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:12,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:12,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:12,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:12,897 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:12,897 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:12,904 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 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:12,921 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:21:12,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:12,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:12,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:12,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:12,929 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:12,929 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:12,943 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:21:12,966 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-11-19 22:21:12,966 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:13,015 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:21:13,019 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 22:21:13,019 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:21:13,020 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 Supporting invariants [] [2019-11-19 22:21:13,229 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-11-19 22:21:13,246 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 22:21:13,249 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 22:21:13,249 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 22:21:13,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:13,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:21:13,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:13,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 22:21:13,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:13,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:21:13,442 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:21:13,467 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-19 22:21:13,469 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 5 states. [2019-11-19 22:21:13,628 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 5 states. Result 36 states and 47 transitions. Complement of second has 10 states. [2019-11-19 22:21:13,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-19 22:21:13,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-19 22:21:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2019-11-19 22:21:13,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 6 letters. [2019-11-19 22:21:13,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:13,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 8 letters. Loop has 6 letters. [2019-11-19 22:21:13,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:13,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 12 letters. [2019-11-19 22:21:13,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:13,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. [2019-11-19 22:21:13,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-19 22:21:13,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 20 states and 29 transitions. [2019-11-19 22:21:13,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-19 22:21:13,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-19 22:21:13,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2019-11-19 22:21:13,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:13,660 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-19 22:21:13,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2019-11-19 22:21:13,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-19 22:21:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-19 22:21:13,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-11-19 22:21:13,688 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-19 22:21:13,688 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-19 22:21:13,688 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-19 22:21:13,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-11-19 22:21:13,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-19 22:21:13,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:13,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:13,690 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:21:13,690 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-19 22:21:13,691 INFO L794 eck$LassoCheckResult]: Stem: 218#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 209#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 210#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 215#L554-1 assume !main_#t~short10; 216#L554-3 main_#t~short12 := main_#t~short10; 219#L554-4 assume !main_#t~short12; 205#L554-6 assume !!main_#t~short12;havoc main_#t~short10;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem8;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 206#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 211#L555-2 [2019-11-19 22:21:13,691 INFO L796 eck$LassoCheckResult]: Loop: 211#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 212#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 224#L554-3 main_#t~short12 := main_#t~short10; 223#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 222#L554-6 assume !!main_#t~short12;havoc main_#t~short10;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem8;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 221#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 211#L555-2 [2019-11-19 22:21:13,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:13,691 INFO L82 PathProgramCache]: Analyzing trace with hash 179475346, now seen corresponding path program 1 times [2019-11-19 22:21:13,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:13,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909897653] [2019-11-19 22:21:13,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:13,749 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:21:13,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909897653] [2019-11-19 22:21:13,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:21:13,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:21:13,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246954699] [2019-11-19 22:21:13,755 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:21:13,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:13,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 2 times [2019-11-19 22:21:13,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:13,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699704586] [2019-11-19 22:21:13,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:13,803 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:14,053 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-11-19 22:21:14,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:14,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:21:14,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:21:14,120 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-19 22:21:14,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:14,133 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2019-11-19 22:21:14,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:21:14,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2019-11-19 22:21:14,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-19 22:21:14,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 20 states and 26 transitions. [2019-11-19 22:21:14,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-19 22:21:14,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-19 22:21:14,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-11-19 22:21:14,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:14,138 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-19 22:21:14,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-11-19 22:21:14,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-19 22:21:14,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-19 22:21:14,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2019-11-19 22:21:14,141 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-19 22:21:14,141 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-19 22:21:14,142 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-19 22:21:14,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2019-11-19 22:21:14,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-19 22:21:14,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:14,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:14,143 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:21:14,143 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-19 22:21:14,144 INFO L794 eck$LassoCheckResult]: Stem: 267#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 254#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 255#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 264#L554-1 assume !main_#t~short10; 265#L554-3 main_#t~short12 := main_#t~short10; 268#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 256#L554-6 assume !!main_#t~short12;havoc main_#t~short10;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem8;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 257#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 260#L555-2 [2019-11-19 22:21:14,144 INFO L796 eck$LassoCheckResult]: Loop: 260#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 261#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 273#L554-3 main_#t~short12 := main_#t~short10; 272#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 271#L554-6 assume !!main_#t~short12;havoc main_#t~short10;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem8;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 270#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 260#L555-2 [2019-11-19 22:21:14,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:14,144 INFO L82 PathProgramCache]: Analyzing trace with hash 179473424, now seen corresponding path program 1 times [2019-11-19 22:21:14,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:14,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171177609] [2019-11-19 22:21:14,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:14,176 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:21:14,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171177609] [2019-11-19 22:21:14,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:21:14,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 22:21:14,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70160912] [2019-11-19 22:21:14,177 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:21:14,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:14,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 3 times [2019-11-19 22:21:14,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:14,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7914767] [2019-11-19 22:21:14,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:14,213 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:14,481 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-11-19 22:21:14,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:14,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:21:14,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:21:14,549 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-19 22:21:14,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:14,582 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2019-11-19 22:21:14,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:21:14,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 29 transitions. [2019-11-19 22:21:14,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-19 22:21:14,586 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 23 transitions. [2019-11-19 22:21:14,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-19 22:21:14,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-19 22:21:14,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2019-11-19 22:21:14,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:14,587 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-19 22:21:14,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2019-11-19 22:21:14,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-19 22:21:14,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-19 22:21:14,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-11-19 22:21:14,590 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-19 22:21:14,590 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-19 22:21:14,590 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-19 22:21:14,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2019-11-19 22:21:14,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-19 22:21:14,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:14,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:14,592 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:21:14,592 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-19 22:21:14,592 INFO L794 eck$LassoCheckResult]: Stem: 322#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 313#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 314#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 319#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 320#L554-3 main_#t~short12 := main_#t~short10; 323#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 309#L554-6 assume !!main_#t~short12;havoc main_#t~short10;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem8;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 310#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 315#L555-2 [2019-11-19 22:21:14,593 INFO L796 eck$LassoCheckResult]: Loop: 315#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 316#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 328#L554-3 main_#t~short12 := main_#t~short10; 327#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 326#L554-6 assume !!main_#t~short12;havoc main_#t~short10;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem8;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 325#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 315#L555-2 [2019-11-19 22:21:14,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:14,593 INFO L82 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 1 times [2019-11-19 22:21:14,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:14,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514415698] [2019-11-19 22:21:14,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:14,637 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:14,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:14,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 4 times [2019-11-19 22:21:14,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:14,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393892262] [2019-11-19 22:21:14,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:14,664 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:14,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:14,665 INFO L82 PathProgramCache]: Analyzing trace with hash -692497897, now seen corresponding path program 1 times [2019-11-19 22:21:14,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:14,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892384114] [2019-11-19 22:21:14,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:14,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:14,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892384114] [2019-11-19 22:21:14,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882136239] [2019-11-19 22:21:14,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:21:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:14,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 22:21:14,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:14,985 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:14,986 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 100 [2019-11-19 22:21:14,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:15,024 INFO L567 ElimStorePlain]: treesize reduction 55, result has 32.9 percent of original size [2019-11-19 22:21:15,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:15,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:92, output treesize:24 [2019-11-19 22:21:15,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:21:15,067 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-19 22:21:15,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:15,075 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:15,076 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2019-11-19 22:21:15,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:21:15,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:21:15,080 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:21:15,087 INFO L567 ElimStorePlain]: treesize reduction 20, result has 13.0 percent of original size [2019-11-19 22:21:15,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:15,088 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:3 [2019-11-19 22:21:15,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:15,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:21:15,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-11-19 22:21:15,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937508157] [2019-11-19 22:21:15,407 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-11-19 22:21:15,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:15,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:21:15,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:21:15,468 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 8 states. [2019-11-19 22:21:15,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:15,593 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-11-19 22:21:15,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:21:15,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2019-11-19 22:21:15,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-19 22:21:15,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2019-11-19 22:21:15,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-19 22:21:15,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-19 22:21:15,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2019-11-19 22:21:15,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:15,596 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-19 22:21:15,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2019-11-19 22:21:15,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-11-19 22:21:15,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-19 22:21:15,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-11-19 22:21:15,600 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-19 22:21:15,600 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-19 22:21:15,600 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-19 22:21:15,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-11-19 22:21:15,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-19 22:21:15,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:15,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:15,602 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-19 22:21:15,602 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-19 22:21:15,602 INFO L794 eck$LassoCheckResult]: Stem: 419#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 411#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 412#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 414#L554-1 [2019-11-19 22:21:15,602 INFO L796 eck$LassoCheckResult]: Loop: 414#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 417#L554-3 main_#t~short12 := main_#t~short10; 420#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 407#L554-6 assume !!main_#t~short12;havoc main_#t~short10;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem8;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 408#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 413#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 414#L554-1 [2019-11-19 22:21:15,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:15,603 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-11-19 22:21:15,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:15,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818973235] [2019-11-19 22:21:15,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:15,626 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:15,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:15,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1187255894, now seen corresponding path program 1 times [2019-11-19 22:21:15,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:15,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541381582] [2019-11-19 22:21:15,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:15,649 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:15,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:15,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450553, now seen corresponding path program 2 times [2019-11-19 22:21:15,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:15,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892069962] [2019-11-19 22:21:15,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:15,714 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:16,045 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-11-19 22:21:16,271 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-19 22:21:16,687 WARN L191 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-11-19 22:21:17,047 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-19 22:21:17,053 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:21:17,054 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:21:17,054 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:21:17,054 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:21:17,054 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:21:17,055 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:17,055 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:21:17,055 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:21:17,055 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca.i_Iteration5_Lasso [2019-11-19 22:21:17,055 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:21:17,055 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:21:17,063 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:21:17,071 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:21:17,073 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:21:17,075 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:21:17,078 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:21:17,080 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:21:17,808 WARN L191 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-11-19 22:21:18,004 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-11-19 22:21:18,005 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:21:18,008 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:21:18,011 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:21:18,016 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:21:18,018 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:21:18,019 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:21:18,021 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:21:18,023 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:21:18,026 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:21:18,028 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:21:18,030 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:21:18,041 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:21:18,044 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:21:18,046 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:21:18,047 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:21:18,052 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:21:18,799 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-11-19 22:21:18,860 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:21:18,860 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:21:18,872 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:21:18,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:18,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:18,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:18,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:18,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:18,876 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:18,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:18,877 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:21:18,883 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:21:18,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:18,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:18,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:18,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:18,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:18,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:18,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:18,900 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:21:18,906 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:21:18,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:18,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:18,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:18,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:18,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:18,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:18,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:18,914 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:21:18,920 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:21:18,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:18,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:18,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:18,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:18,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:18,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:18,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:18,925 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:21:18,934 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:21:18,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:18,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:18,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:18,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:18,945 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:18,945 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:18,949 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:21:18,956 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:21:18,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:18,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:18,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:18,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:18,985 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:18,985 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:19,002 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) [2019-11-19 22:21:19,025 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:21:19,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:19,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:19,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:19,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:19,033 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:19,033 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:19,040 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) [2019-11-19 22:21:19,065 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:21:19,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:19,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:19,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:19,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:19,071 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:19,072 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:19,078 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:21:19,102 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:21:19,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:19,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:19,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:19,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:19,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:19,110 INFO L402 nArgumentSynthesizer]: A total of 2 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:21:19,119 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:21:19,142 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-19 22:21:19,142 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. 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) [2019-11-19 22:21:19,153 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:19,157 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 22:21:19,158 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:21:19,158 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2 Supporting invariants [] [2019-11-19 22:21:19,352 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-11-19 22:21:19,358 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 22:21:19,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:19,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 22:21:19,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:19,433 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:19,434 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-19 22:21:19,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:19,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:19,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:19,446 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-11-19 22:21:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:19,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:21:19,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:19,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:21:19,599 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:19,600 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 58 [2019-11-19 22:21:19,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:19,659 INFO L567 ElimStorePlain]: treesize reduction 18, result has 73.1 percent of original size [2019-11-19 22:21:19,661 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:21:19,661 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:108, output treesize:42 [2019-11-19 22:21:19,711 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:21:19,712 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-19 22:21:19,712 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 7 states. [2019-11-19 22:21:19,823 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 37 states and 40 transitions. Complement of second has 10 states. [2019-11-19 22:21:19,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-19 22:21:19,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-19 22:21:19,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-11-19 22:21:19,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 3 letters. Loop has 6 letters. [2019-11-19 22:21:19,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:19,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 9 letters. Loop has 6 letters. [2019-11-19 22:21:19,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:19,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 3 letters. Loop has 12 letters. [2019-11-19 22:21:19,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:19,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 40 transitions. [2019-11-19 22:21:19,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-19 22:21:19,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 20 states and 21 transitions. [2019-11-19 22:21:19,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-19 22:21:19,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-19 22:21:19,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2019-11-19 22:21:19,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:19,835 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-11-19 22:21:19,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2019-11-19 22:21:19,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-11-19 22:21:19,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-19 22:21:19,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-11-19 22:21:19,838 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-19 22:21:19,838 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-19 22:21:19,838 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-19 22:21:19,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2019-11-19 22:21:19,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-19 22:21:19,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:19,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:19,842 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:21:19,842 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-19 22:21:19,843 INFO L794 eck$LassoCheckResult]: Stem: 630#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 623#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 624#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 625#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 629#L554-3 main_#t~short12 := main_#t~short10; 632#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 621#L554-6 assume !!main_#t~short12;havoc main_#t~short10;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem8;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 622#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 626#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 627#L554-1 [2019-11-19 22:21:19,843 INFO L796 eck$LassoCheckResult]: Loop: 627#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 628#L554-3 main_#t~short12 := main_#t~short10; 631#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 619#L554-6 assume !!main_#t~short12;havoc main_#t~short10;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem8;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 620#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 633#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 627#L554-1 [2019-11-19 22:21:19,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:19,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450491, now seen corresponding path program 2 times [2019-11-19 22:21:19,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:19,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343801842] [2019-11-19 22:21:19,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:19,902 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:19,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:19,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1187255894, now seen corresponding path program 2 times [2019-11-19 22:21:19,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:19,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991890426] [2019-11-19 22:21:19,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:19,926 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:19,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:19,927 INFO L82 PathProgramCache]: Analyzing trace with hash 816748368, now seen corresponding path program 2 times [2019-11-19 22:21:19,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:19,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494638943] [2019-11-19 22:21:19,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:19,991 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:20,277 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-11-19 22:21:20,469 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-19 22:21:21,467 WARN L191 SmtUtils]: Spent 995.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 123 [2019-11-19 22:21:22,371 WARN L191 SmtUtils]: Spent 883.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-19 22:21:22,376 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:21:22,376 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:21:22,376 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:21:22,376 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:21:22,376 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:21:22,377 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:22,377 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:21:22,377 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:21:22,377 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca.i_Iteration6_Lasso [2019-11-19 22:21:22,377 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:21:22,377 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:21:22,388 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:21:22,401 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:21:22,403 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:21:22,405 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:21:22,407 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:21:22,409 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:21:22,412 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:21:22,414 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:21:22,417 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:21:22,419 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:21:22,425 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:21:22,427 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:21:22,428 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:21:22,429 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:21:22,435 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:21:23,411 WARN L191 SmtUtils]: Spent 758.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-11-19 22:21:23,648 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-11-19 22:21:23,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:21:23,652 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:21:23,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:21:23,655 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:21:23,658 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:21:23,969 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-11-19 22:21:24,249 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-11-19 22:21:24,456 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-11-19 22:21:24,611 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:21:24,611 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:24,618 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:21:24,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:24,619 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:24,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:24,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:24,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:24,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:24,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:24,622 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) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:24,628 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:21:24,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:24,629 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:24,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:24,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:24,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:24,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:24,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:24,632 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) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:24,638 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:21:24,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:24,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:24,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:24,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:24,643 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:24,643 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:24,646 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) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:24,652 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:21:24,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:24,653 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:24,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:24,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:24,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:24,654 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:24,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:24,655 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) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:24,669 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:21:24,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:24,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:24,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:24,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:24,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:24,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:24,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:24,674 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) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:24,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 [2019-11-19 22:21:24,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:24,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:24,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:24,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:24,684 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:24,684 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:24,688 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) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:24,694 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:21:24,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:24,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:24,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:24,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:24,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:24,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:24,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:24,698 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) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:24,704 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:21:24,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:24,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:24,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:24,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:24,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:24,707 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:24,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:24,708 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 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:21:24,714 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:21:24,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:24,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:24,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:24,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:24,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:24,717 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:24,720 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:24,726 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:21:24,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:24,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:24,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:24,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:24,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:24,730 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:24,730 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:24,735 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 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:24,741 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:21:24,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:24,742 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:24,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:24,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:24,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:24,743 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:24,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:24,745 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 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:24,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:21:24,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:24,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:24,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:24,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:24,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:24,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:24,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:24,755 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 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:24,768 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:21:24,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:24,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:24,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:24,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:24,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:24,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:24,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:24,779 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 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:21:24,788 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:21:24,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:24,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:24,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:24,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:24,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:24,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:24,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:24,794 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:21:24,806 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:21:24,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:24,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:24,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:24,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:24,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:24,811 INFO L402 nArgumentSynthesizer]: A total of 2 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:21:24,817 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:21:24,824 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:21:24,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:24,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:24,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:24,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:24,828 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:24,828 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:21:24,834 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:21:24,841 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:21:24,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:24,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:24,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:24,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:24,844 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:24,845 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:21:24,848 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) [2019-11-19 22:21:24,857 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:21:24,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:24,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:24,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:24,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:24,862 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:24,862 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:24,866 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:21:24,874 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:21:24,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:24,877 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-19 22:21:24,877 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-19 22:21:24,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:24,899 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-19 22:21:24,899 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-19 22:21:24,944 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:21:24,977 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-19 22:21:24,977 INFO L444 ModelExtractionUtils]: 16 out of 36 variables were initially zero. Simplification set additionally 18 variables to zero. 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) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:24,986 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:21:24,989 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-11-19 22:21:24,989 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:21:24,990 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_3 Supporting invariants [] [2019-11-19 22:21:25,115 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-11-19 22:21:25,122 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 22:21:25,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:25,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 22:21:25,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:25,203 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:25,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-19 22:21:25,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:25,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:25,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:25,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-11-19 22:21:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:25,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:21:25,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:25,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:21:25,317 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:25,317 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 58 [2019-11-19 22:21:25,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:25,360 INFO L567 ElimStorePlain]: treesize reduction 18, result has 73.1 percent of original size [2019-11-19 22:21:25,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:21:25,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:108, output treesize:42 [2019-11-19 22:21:25,394 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:21:25,394 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-19 22:21:25,394 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-11-19 22:21:25,462 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 24 states and 25 transitions. Complement of second has 10 states. [2019-11-19 22:21:25,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-19 22:21:25,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-19 22:21:25,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-11-19 22:21:25,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 9 letters. Loop has 6 letters. [2019-11-19 22:21:25,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:25,464 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 22:21:25,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:25,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 22:21:25,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:25,518 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:25,518 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-19 22:21:25,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:25,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:25,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:25,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-11-19 22:21:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:25,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:21:25,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:25,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:21:25,635 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:25,636 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 58 [2019-11-19 22:21:25,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:25,682 INFO L567 ElimStorePlain]: treesize reduction 18, result has 73.1 percent of original size [2019-11-19 22:21:25,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:21:25,684 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:108, output treesize:42 [2019-11-19 22:21:25,716 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:21:25,717 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-19 22:21:25,717 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-11-19 22:21:25,793 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 24 states and 25 transitions. Complement of second has 10 states. [2019-11-19 22:21:25,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-19 22:21:25,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-19 22:21:25,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-11-19 22:21:25,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 9 letters. Loop has 6 letters. [2019-11-19 22:21:25,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:25,794 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 22:21:25,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:25,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 22:21:25,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:25,852 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:25,853 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-19 22:21:25,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:25,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:25,860 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:25,861 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-11-19 22:21:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:25,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:21:25,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:25,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:21:25,964 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:25,965 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 58 [2019-11-19 22:21:25,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:26,010 INFO L567 ElimStorePlain]: treesize reduction 18, result has 73.1 percent of original size [2019-11-19 22:21:26,012 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:21:26,012 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:108, output treesize:42 [2019-11-19 22:21:26,044 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:21:26,045 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-19 22:21:26,045 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-11-19 22:21:26,153 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 26 states and 28 transitions. Complement of second has 11 states. [2019-11-19 22:21:26,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-19 22:21:26,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-19 22:21:26,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2019-11-19 22:21:26,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 6 letters. [2019-11-19 22:21:26,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:26,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-19 22:21:26,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:26,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 12 letters. [2019-11-19 22:21:26,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:26,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2019-11-19 22:21:26,158 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 22:21:26,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2019-11-19 22:21:26,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-19 22:21:26,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-19 22:21:26,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-19 22:21:26,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:21:26,159 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:21:26,159 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:21:26,159 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:21:26,160 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-19 22:21:26,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-19 22:21:26,160 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 22:21:26,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-19 22:21:26,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 10:21:26 BoogieIcfgContainer [2019-11-19 22:21:26,168 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-19 22:21:26,169 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:21:26,169 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:21:26,169 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:21:26,170 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:21:09" (3/4) ... [2019-11-19 22:21:26,175 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 22:21:26,175 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:21:26,177 INFO L168 Benchmark]: Toolchain (without parser) took 17693.67 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 353.9 MB). Free memory was 955.0 MB in the beginning and 859.7 MB in the end (delta: 95.3 MB). Peak memory consumption was 449.2 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:26,177 INFO L168 Benchmark]: CDTParser took 0.32 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:21:26,182 INFO L168 Benchmark]: CACSL2BoogieTranslator took 663.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:26,184 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.17 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:26,184 INFO L168 Benchmark]: Boogie Preprocessor took 28.28 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:26,184 INFO L168 Benchmark]: RCFGBuilder took 421.92 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: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:26,185 INFO L168 Benchmark]: BuchiAutomizer took 16515.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 218.1 MB). Free memory was 1.1 GB in the beginning and 859.7 MB in the end (delta: 232.2 MB). Peak memory consumption was 450.3 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:26,185 INFO L168 Benchmark]: Witness Printer took 6.87 ms. Allocated memory is still 1.4 GB. Free memory is still 859.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:21:26,188 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.32 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 663.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.17 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.28 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 421.92 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: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16515.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 218.1 MB). Free memory was 1.1 GB in the beginning and 859.7 MB in the end (delta: 232.2 MB). Peak memory consumption was 450.3 MB. Max. memory is 11.5 GB. * Witness Printer took 6.87 ms. Allocated memory is still 1.4 GB. Free memory is still 859.7 MB. 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[z][z] + unknown-#memory_int-unknown[y][y] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.4s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 14.1s. Construction of modules took 0.2s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 47 SDtfs, 51 SDslu, 48 SDs, 0 SdLazy, 144 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital1016 mio100 ax103 hnf99 lsp64 ukn54 mio100 lsp30 div100 bol104 ite100 ukn100 eq174 hnf88 smp97 dnf214 smp66 tf100 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 121ms VariablesStem: 7 VariablesLoop: 10 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...