./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 -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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.25-8bd4bc6 [2020-07-29 01:32:23,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:32:23,533 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:32:23,544 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:32:23,545 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:32:23,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:32:23,547 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:32:23,549 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:32:23,551 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:32:23,552 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:32:23,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:32:23,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:32:23,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:32:23,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:32:23,557 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:32:23,558 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:32:23,559 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:32:23,560 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:32:23,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:32:23,564 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:32:23,565 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:32:23,566 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:32:23,568 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:32:23,568 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:32:23,571 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:32:23,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:32:23,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:32:23,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:32:23,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:32:23,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:32:23,575 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:32:23,575 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:32:23,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:32:23,577 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:32:23,578 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:32:23,578 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:32:23,579 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:32:23,579 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:32:23,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:32:23,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:32:23,581 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:32:23,582 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:32:23,599 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:32:23,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:32:23,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:32:23,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:32:23,601 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:32:23,601 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:32:23,602 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:32:23,602 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:32:23,602 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:32:23,602 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:32:23,602 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:32:23,603 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:32:23,603 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:32:23,603 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:32:23,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:32:23,604 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:32:23,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:32:23,604 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:32:23,604 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:32:23,604 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:32:23,605 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:32:23,605 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:32:23,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:32:23,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:32:23,606 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:32:23,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:32:23,606 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:32:23,606 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:32:23,606 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:32:23,607 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:32:23,608 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 [2020-07-29 01:32:23,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:32:23,915 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:32:23,919 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:32:23,920 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:32:23,923 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:32:23,925 INFO L429 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 [2020-07-29 01:32:23,987 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a7e3e294/3ccae5ddbadb4eec9f848ea865b019e5/FLAGa3b0bd9f8 [2020-07-29 01:32:24,448 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:32:24,449 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca.i [2020-07-29 01:32:24,462 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a7e3e294/3ccae5ddbadb4eec9f848ea865b019e5/FLAGa3b0bd9f8 [2020-07-29 01:32:24,764 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a7e3e294/3ccae5ddbadb4eec9f848ea865b019e5 [2020-07-29 01:32:24,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:32:24,771 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:32:24,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:32:24,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:32:24,776 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:32:24,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:32:24" (1/1) ... [2020-07-29 01:32:24,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49a37da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:24, skipping insertion in model container [2020-07-29 01:32:24,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:32:24" (1/1) ... [2020-07-29 01:32:24,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:32:24,824 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:32:25,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:32:25,223 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:32:25,307 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:32:25,357 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:32:25,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:25 WrapperNode [2020-07-29 01:32:25,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:32:25,359 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:32:25,359 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:32:25,359 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:32:25,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:25" (1/1) ... [2020-07-29 01:32:25,382 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:25" (1/1) ... [2020-07-29 01:32:25,405 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:32:25,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:32:25,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:32:25,406 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:32:25,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:25" (1/1) ... [2020-07-29 01:32:25,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:25" (1/1) ... [2020-07-29 01:32:25,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:25" (1/1) ... [2020-07-29 01:32:25,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:25" (1/1) ... [2020-07-29 01:32:25,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:25" (1/1) ... [2020-07-29 01:32:25,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:25" (1/1) ... [2020-07-29 01:32:25,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:25" (1/1) ... [2020-07-29 01:32:25,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:32:25,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:32:25,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:32:25,438 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:32:25,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:25" (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 [2020-07-29 01:32:25,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:32:25,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:32:25,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:32:25,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:32:25,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:32:25,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:32:25,931 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:32:25,931 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-29 01:32:25,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:32:25 BoogieIcfgContainer [2020-07-29 01:32:25,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:32:25,936 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:32:25,936 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:32:25,939 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:32:25,940 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:32:25,941 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:32:24" (1/3) ... [2020-07-29 01:32:25,942 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c91ae77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:32:25, skipping insertion in model container [2020-07-29 01:32:25,942 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:32:25,942 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:25" (2/3) ... [2020-07-29 01:32:25,943 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c91ae77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:32:25, skipping insertion in model container [2020-07-29 01:32:25,943 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:32:25,943 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:32:25" (3/3) ... [2020-07-29 01:32:25,945 INFO L371 chiAutomizerObserver]: Analyzing ICFG Ben-Amram-2010LMCS-Ex2.3-alloca.i [2020-07-29 01:32:25,996 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:32:25,997 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:32:25,997 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:32:25,997 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:32:25,998 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:32:25,998 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:32:25,998 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:32:25,998 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:32:26,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-29 01:32:26,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:32:26,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:26,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:26,043 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:32:26,043 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:32:26,044 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:32:26,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-29 01:32:26,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:32:26,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:26,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:26,047 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:32:26,048 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:32:26,056 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 [2020-07-29 01:32:26,057 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~short12;havoc main_#t~mem11;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;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~mem14;havoc main_#t~mem13;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 [2020-07-29 01:32:26,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:26,062 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 01:32:26,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:26,071 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697940300] [2020-07-29 01:32:26,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:26,198 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:26,226 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:26,249 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:26,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:26,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 1 times [2020-07-29 01:32:26,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:26,252 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132678539] [2020-07-29 01:32:26,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:26,296 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:26,322 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:26,328 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:26,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:26,330 INFO L82 PathProgramCache]: Analyzing trace with hash 177626380, now seen corresponding path program 1 times [2020-07-29 01:32:26,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:26,330 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234626608] [2020-07-29 01:32:26,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:26,373 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:26,419 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:26,431 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:26,752 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2020-07-29 01:32:27,194 WARN L193 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 73 [2020-07-29 01:32:27,405 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-07-29 01:32:27,421 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:32:27,422 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:32:27,422 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:32:27,422 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:32:27,423 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:32:27,423 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:27,423 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:32:27,423 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:32:27,423 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca.i_Iteration1_Lasso [2020-07-29 01:32:27,424 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:32:27,424 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:32:27,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:27,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:27,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:27,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:27,885 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2020-07-29 01:32:28,019 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2020-07-29 01:32:28,023 WARN L257 bleTransFormulaUtils]: 3 quantified variables [2020-07-29 01:32:28,024 WARN L257 bleTransFormulaUtils]: 3 quantified variables [2020-07-29 01:32:28,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:28,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:28,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:28,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:28,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:28,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:28,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:28,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:28,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:28,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:28,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:28,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:28,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:28,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:28,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:28,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:28,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:28,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:29,118 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:32:29,124 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:29,142 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 [2020-07-29 01:32:29,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:29,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:29,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:29,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:29,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:29,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:29,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:29,151 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) [2020-07-29 01:32:29,200 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 [2020-07-29 01:32:29,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:29,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:29,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:29,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:29,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:29,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:29,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:29,208 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 [2020-07-29 01:32:29,243 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 [2020-07-29 01:32:29,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:29,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:29,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:29,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:29,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:29,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:29,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:29,250 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 [2020-07-29 01:32:29,272 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 [2020-07-29 01:32:29,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:29,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:29,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:29,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:29,280 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:29,280 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:29,291 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:29,321 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 [2020-07-29 01:32:29,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:29,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:29,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:29,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:29,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:29,329 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:29,335 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 [2020-07-29 01:32:29,358 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 [2020-07-29 01:32:29,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:29,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:29,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:29,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:29,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:29,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:29,368 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:29,393 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 [2020-07-29 01:32:29,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:29,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:29,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:29,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:29,397 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:29,397 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:29,400 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 [2020-07-29 01:32:29,422 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 [2020-07-29 01:32:29,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:29,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:29,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:29,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:29,437 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:29,437 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:29,457 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 [2020-07-29 01:32:29,494 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 [2020-07-29 01:32:29,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:29,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:29,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:29,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:29,502 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:29,503 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:29,516 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) [2020-07-29 01:32:29,566 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 [2020-07-29 01:32:29,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:29,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:29,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:29,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:29,573 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:29,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:29,584 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:29,641 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 [2020-07-29 01:32:29,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:29,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:29,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:29,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:29,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:29,652 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:29,667 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:32:29,689 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-07-29 01:32:29,689 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 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:29,745 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:32:29,778 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:32:29,779 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:32:29,780 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 [] [2020-07-29 01:32:30,022 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2020-07-29 01:32:30,029 INFO L393 LassoCheck]: Loop: "call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0;" "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;" "main_#t~short12 := main_#t~short10;" "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;" "assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem11;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;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);" "assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem14;havoc main_#t~mem13;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;" [2020-07-29 01:32:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:30,072 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:32:30,073 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:32:30,074 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:32:30,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:30,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:32:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:30,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:30,160 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {22#unseeded} is VALID [2020-07-29 01:32:30,163 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#unseeded} 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; {156#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) unseeded)} is VALID [2020-07-29 01:32:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:30,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:32:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:30,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:30,235 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:32:30,358 INFO L280 TraceCheckUtils]: 0: Hoare triple {157#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (>= oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset))))} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; {157#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (>= oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset))))} is VALID [2020-07-29 01:32:30,360 INFO L280 TraceCheckUtils]: 1: Hoare triple {157#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (>= oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset))))} 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; {157#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (>= oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset))))} is VALID [2020-07-29 01:32:30,361 INFO L280 TraceCheckUtils]: 2: Hoare triple {157#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (>= oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset))))} main_#t~short12 := main_#t~short10; {157#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (>= oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset))))} is VALID [2020-07-29 01:32:30,363 INFO L280 TraceCheckUtils]: 3: Hoare triple {157#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (>= oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset))))} 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; {177#(and (or (<= 1 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not |ULTIMATE.start_main_#t~short12|)) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} is VALID [2020-07-29 01:32:30,365 INFO L280 TraceCheckUtils]: 4: Hoare triple {177#(and (or (<= 1 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not |ULTIMATE.start_main_#t~short12|)) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem11;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;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); {181#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) |ULTIMATE.start_main_#t~mem14|) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))) (<= |ULTIMATE.start_main_#t~mem13| (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)) (<= 1 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} is VALID [2020-07-29 01:32:30,369 INFO L280 TraceCheckUtils]: 5: Hoare triple {181#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) |ULTIMATE.start_main_#t~mem14|) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))) (<= |ULTIMATE.start_main_#t~mem13| (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)) (<= 1 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem14;havoc main_#t~mem13;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; {159#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)))) unseeded) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} is VALID [2020-07-29 01:32:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:32:30,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:32:30,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:32:30,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:32:30,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,430 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 [2020-07-29 01:32:30,432 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 5 states. [2020-07-29 01:32:30,658 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 5 states. Result 36 states and 47 transitions. Complement of second has 10 states. [2020-07-29 01:32:30,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:32:30,659 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:30,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-29 01:32:30,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:32:30,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:30,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:30,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:32:30,667 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:32:30,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:30,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:30,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2020-07-29 01:32:30,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:32:30,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:30,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:30,672 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states. [2020-07-29 01:32:30,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:32:30,675 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:32:30,675 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:32:30,677 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:32:30,678 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:32:30,678 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 36 states and 47 transitions. cyclomatic complexity: 13 [2020-07-29 01:32:30,680 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:32:30,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:32:30,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:32:30,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:32:30,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:32:30,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:32:30,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:32:30,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:32:30,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:32:30,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:32:30,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 36 letters. Loop has 36 letters. [2020-07-29 01:32:30,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 36 letters. Loop has 36 letters. [2020-07-29 01:32:30,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 13 Stem has 36 letters. Loop has 36 letters. [2020-07-29 01:32:30,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:32:30,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:32:30,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:32:30,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:32:30,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:32:30,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:32:30,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:32:30,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:32:30,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:32:30,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:32:30,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:32:30,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:32:30,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 3 letters. Loop has 6 letters. [2020-07-29 01:32:30,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 6 letters. [2020-07-29 01:32:30,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 6 letters. [2020-07-29 01:32:30,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:32:30,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:32:30,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:32:30,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 5 letters. Loop has 6 letters. [2020-07-29 01:32:30,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 6 letters. [2020-07-29 01:32:30,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 6 letters. [2020-07-29 01:32:30,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 7 letters. Loop has 6 letters. [2020-07-29 01:32:30,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 6 letters. [2020-07-29 01:32:30,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 6 letters. [2020-07-29 01:32:30,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:32:30,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:32:30,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:32:30,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:32:30,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:32:30,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:32:30,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:30,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:30,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:30,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:32:30,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:32:30,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:32:30,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:32:30,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:32:30,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 13 Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:32:30,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:32:30,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:32:30,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:32:30,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:32:30,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:32:30,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:32:30,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:32:30,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:32:30,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:32:30,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,707 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:30,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:32:30,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2020-07-29 01:32:30,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:32:30,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:32:30,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 12 letters. [2020-07-29 01:32:30,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:30,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. cyclomatic complexity: 13 [2020-07-29 01:32:30,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:32:30,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 20 states and 29 transitions. [2020-07-29 01:32:30,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 01:32:30,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 01:32:30,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2020-07-29 01:32:30,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:32:30,724 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-07-29 01:32:30,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2020-07-29 01:32:30,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-29 01:32:30,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:32:30,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 29 transitions. Second operand 20 states. [2020-07-29 01:32:30,751 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 29 transitions. Second operand 20 states. [2020-07-29 01:32:30,753 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. Second operand 20 states. [2020-07-29 01:32:30,757 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:30,760 INFO L93 Difference]: Finished difference Result 20 states and 29 transitions. [2020-07-29 01:32:30,761 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 29 transitions. [2020-07-29 01:32:30,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:30,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:30,762 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states and 29 transitions. [2020-07-29 01:32:30,762 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states and 29 transitions. [2020-07-29 01:32:30,763 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:30,765 INFO L93 Difference]: Finished difference Result 20 states and 29 transitions. [2020-07-29 01:32:30,765 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 29 transitions. [2020-07-29 01:32:30,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:30,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:30,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:32:30,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:32:30,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 01:32:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2020-07-29 01:32:30,770 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-07-29 01:32:30,770 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-07-29 01:32:30,770 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:32:30,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2020-07-29 01:32:30,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:32:30,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:30,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:30,772 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:32:30,772 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:32:30,772 INFO L794 eck$LassoCheckResult]: Stem: 249#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 240#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; 241#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 242#L554-1 assume !main_#t~short10; 243#L554-3 main_#t~short12 := main_#t~short10; 250#L554-4 assume !main_#t~short12; 236#L554-6 assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem11;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;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); 237#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;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; 246#L555-2 [2020-07-29 01:32:30,772 INFO L796 eck$LassoCheckResult]: Loop: 246#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 247#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; 255#L554-3 main_#t~short12 := main_#t~short10; 254#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; 253#L554-6 assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem11;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;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); 252#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem14;havoc main_#t~mem13;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; 246#L555-2 [2020-07-29 01:32:30,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:30,773 INFO L82 PathProgramCache]: Analyzing trace with hash 179475346, now seen corresponding path program 1 times [2020-07-29 01:32:30,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:30,773 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206209191] [2020-07-29 01:32:30,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:30,855 INFO L280 TraceCheckUtils]: 0: Hoare triple {339#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {339#true} is VALID [2020-07-29 01:32:30,855 INFO L280 TraceCheckUtils]: 1: Hoare triple {339#true} 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; {339#true} is VALID [2020-07-29 01:32:30,855 INFO L280 TraceCheckUtils]: 2: Hoare triple {339#true} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; {339#true} is VALID [2020-07-29 01:32:30,856 INFO L280 TraceCheckUtils]: 3: Hoare triple {339#true} assume !main_#t~short10; {339#true} is VALID [2020-07-29 01:32:30,856 INFO L280 TraceCheckUtils]: 4: Hoare triple {339#true} main_#t~short12 := main_#t~short10; {339#true} is VALID [2020-07-29 01:32:30,857 INFO L280 TraceCheckUtils]: 5: Hoare triple {339#true} assume !main_#t~short12; {341#(not |ULTIMATE.start_main_#t~short12|)} is VALID [2020-07-29 01:32:30,858 INFO L280 TraceCheckUtils]: 6: Hoare triple {341#(not |ULTIMATE.start_main_#t~short12|)} assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem11;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;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); {340#false} is VALID [2020-07-29 01:32:30,858 INFO L280 TraceCheckUtils]: 7: Hoare triple {340#false} assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;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; {340#false} is VALID [2020-07-29 01:32:30,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:32:30,860 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206209191] [2020-07-29 01:32:30,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:32:30,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:32:30,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786637287] [2020-07-29 01:32:30,866 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:32:30,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:30,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 2 times [2020-07-29 01:32:30,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:30,867 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384996100] [2020-07-29 01:32:30,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:30,907 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:30,939 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:30,948 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:31,217 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2020-07-29 01:32:31,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:32:31,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:32:31,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:32:31,311 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 3 states. [2020-07-29 01:32:31,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:32:31,350 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-07-29 01:32:31,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:32:31,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:32:31,365 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:32:31,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2020-07-29 01:32:31,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:32:31,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 20 states and 26 transitions. [2020-07-29 01:32:31,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 01:32:31,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 01:32:31,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2020-07-29 01:32:31,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:32:31,372 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-07-29 01:32:31,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2020-07-29 01:32:31,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-29 01:32:31,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:32:31,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 26 transitions. Second operand 20 states. [2020-07-29 01:32:31,374 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 26 transitions. Second operand 20 states. [2020-07-29 01:32:31,375 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 20 states. [2020-07-29 01:32:31,375 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:31,377 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-07-29 01:32:31,377 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-07-29 01:32:31,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:31,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:31,379 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states and 26 transitions. [2020-07-29 01:32:31,379 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states and 26 transitions. [2020-07-29 01:32:31,380 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:31,382 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-07-29 01:32:31,382 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-07-29 01:32:31,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:31,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:31,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:32:31,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:32:31,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 01:32:31,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2020-07-29 01:32:31,385 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-07-29 01:32:31,386 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-07-29 01:32:31,386 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:32:31,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2020-07-29 01:32:31,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:32:31,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:31,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:31,389 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:32:31,389 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:32:31,389 INFO L794 eck$LassoCheckResult]: Stem: 380#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 371#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; 372#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 376#L554-1 assume !main_#t~short10; 378#L554-3 main_#t~short12 := main_#t~short10; 381#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; 367#L554-6 assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem11;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;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); 368#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;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; 373#L555-2 [2020-07-29 01:32:31,389 INFO L796 eck$LassoCheckResult]: Loop: 373#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 374#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; 386#L554-3 main_#t~short12 := main_#t~short10; 385#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; 384#L554-6 assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem11;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;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); 383#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem14;havoc main_#t~mem13;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; 373#L555-2 [2020-07-29 01:32:31,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:31,395 INFO L82 PathProgramCache]: Analyzing trace with hash 179473424, now seen corresponding path program 1 times [2020-07-29 01:32:31,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:31,396 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895342872] [2020-07-29 01:32:31,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:31,440 INFO L280 TraceCheckUtils]: 0: Hoare triple {470#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {470#true} is VALID [2020-07-29 01:32:31,440 INFO L280 TraceCheckUtils]: 1: Hoare triple {470#true} 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; {470#true} is VALID [2020-07-29 01:32:31,441 INFO L280 TraceCheckUtils]: 2: Hoare triple {470#true} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; {470#true} is VALID [2020-07-29 01:32:31,441 INFO L280 TraceCheckUtils]: 3: Hoare triple {470#true} assume !main_#t~short10; {472#(not |ULTIMATE.start_main_#t~short10|)} is VALID [2020-07-29 01:32:31,442 INFO L280 TraceCheckUtils]: 4: Hoare triple {472#(not |ULTIMATE.start_main_#t~short10|)} main_#t~short12 := main_#t~short10; {473#(not |ULTIMATE.start_main_#t~short12|)} is VALID [2020-07-29 01:32:31,443 INFO L280 TraceCheckUtils]: 5: Hoare triple {473#(not |ULTIMATE.start_main_#t~short12|)} 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; {471#false} is VALID [2020-07-29 01:32:31,443 INFO L280 TraceCheckUtils]: 6: Hoare triple {471#false} assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem11;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;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); {471#false} is VALID [2020-07-29 01:32:31,443 INFO L280 TraceCheckUtils]: 7: Hoare triple {471#false} assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;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; {471#false} is VALID [2020-07-29 01:32:31,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:32:31,444 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895342872] [2020-07-29 01:32:31,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:32:31,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:32:31,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296105681] [2020-07-29 01:32:31,445 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:32:31,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:31,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 3 times [2020-07-29 01:32:31,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:31,446 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047802326] [2020-07-29 01:32:31,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:31,459 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:31,471 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:31,474 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:31,681 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2020-07-29 01:32:31,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:32:31,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:32:31,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:32:31,761 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-07-29 01:32:31,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:32:31,842 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-07-29 01:32:31,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:32:31,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:32:31,861 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:32:31,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 29 transitions. [2020-07-29 01:32:31,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:32:31,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 23 transitions. [2020-07-29 01:32:31,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 01:32:31,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 01:32:31,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2020-07-29 01:32:31,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:32:31,864 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-07-29 01:32:31,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2020-07-29 01:32:31,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-29 01:32:31,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:32:31,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 23 transitions. Second operand 20 states. [2020-07-29 01:32:31,866 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 23 transitions. Second operand 20 states. [2020-07-29 01:32:31,867 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 20 states. [2020-07-29 01:32:31,867 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:31,868 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-07-29 01:32:31,869 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-07-29 01:32:31,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:31,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:31,869 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states and 23 transitions. [2020-07-29 01:32:31,869 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states and 23 transitions. [2020-07-29 01:32:31,870 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:31,871 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-07-29 01:32:31,871 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-07-29 01:32:31,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:31,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:31,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:32:31,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:32:31,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 01:32:31,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-07-29 01:32:31,873 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-07-29 01:32:31,873 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-07-29 01:32:31,873 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:32:31,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2020-07-29 01:32:31,874 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:32:31,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:31,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:31,875 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:32:31,875 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:32:31,875 INFO L794 eck$LassoCheckResult]: Stem: 517#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 508#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; 509#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 510#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; 511#L554-3 main_#t~short12 := main_#t~short10; 518#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; 504#L554-6 assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem11;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;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); 505#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;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; 514#L555-2 [2020-07-29 01:32:31,875 INFO L796 eck$LassoCheckResult]: Loop: 514#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 515#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; 523#L554-3 main_#t~short12 := main_#t~short10; 522#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; 521#L554-6 assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem11;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;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); 520#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem14;havoc main_#t~mem13;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; 514#L555-2 [2020-07-29 01:32:31,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:31,876 INFO L82 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 1 times [2020-07-29 01:32:31,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:31,876 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803380705] [2020-07-29 01:32:31,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:31,895 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:31,913 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:31,918 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:31,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:31,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 4 times [2020-07-29 01:32:31,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:31,919 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216718922] [2020-07-29 01:32:31,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:31,934 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:31,944 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:31,947 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:31,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:31,948 INFO L82 PathProgramCache]: Analyzing trace with hash -692497897, now seen corresponding path program 1 times [2020-07-29 01:32:31,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:31,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966911458] [2020-07-29 01:32:31,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:32,078 INFO L280 TraceCheckUtils]: 0: Hoare triple {611#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {611#true} is VALID [2020-07-29 01:32:32,080 INFO L280 TraceCheckUtils]: 1: Hoare triple {611#true} 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; {613#(not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base))} is VALID [2020-07-29 01:32:32,081 INFO L280 TraceCheckUtils]: 2: Hoare triple {613#(not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base))} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; {613#(not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base))} is VALID [2020-07-29 01:32:32,081 INFO L280 TraceCheckUtils]: 3: Hoare triple {613#(not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base))} 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; {613#(not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base))} is VALID [2020-07-29 01:32:32,082 INFO L280 TraceCheckUtils]: 4: Hoare triple {613#(not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base))} main_#t~short12 := main_#t~short10; {613#(not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base))} is VALID [2020-07-29 01:32:32,082 INFO L280 TraceCheckUtils]: 5: Hoare triple {613#(not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base))} 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; {613#(not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base))} is VALID [2020-07-29 01:32:32,083 INFO L280 TraceCheckUtils]: 6: Hoare triple {613#(not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base))} assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem11;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;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); {613#(not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base))} is VALID [2020-07-29 01:32:32,085 INFO L280 TraceCheckUtils]: 7: Hoare triple {613#(not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base))} assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;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; {614#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:32:32,085 INFO L280 TraceCheckUtils]: 8: Hoare triple {614#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; {614#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:32:32,086 INFO L280 TraceCheckUtils]: 9: Hoare triple {614#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} 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; {614#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:32:32,087 INFO L280 TraceCheckUtils]: 10: Hoare triple {614#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} main_#t~short12 := main_#t~short10; {614#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:32:32,088 INFO L280 TraceCheckUtils]: 11: Hoare triple {614#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} 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; {614#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:32:32,089 INFO L280 TraceCheckUtils]: 12: Hoare triple {614#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem11;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;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); {615#(<= (+ |ULTIMATE.start_main_#t~mem13| 1) |ULTIMATE.start_main_#t~mem14|)} is VALID [2020-07-29 01:32:32,090 INFO L280 TraceCheckUtils]: 13: Hoare triple {615#(<= (+ |ULTIMATE.start_main_#t~mem13| 1) |ULTIMATE.start_main_#t~mem14|)} assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem14;havoc main_#t~mem13;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; {612#false} is VALID [2020-07-29 01:32:32,091 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:32:32,091 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966911458] [2020-07-29 01:32:32,092 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51887978] [2020-07-29 01:32:32,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:32:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:32,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:32:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:32,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:32,201 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-29 01:32:32,205 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:32:32,207 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:32:32,208 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:32:32,208 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2020-07-29 01:32:32,277 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:32:32,278 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 82 [2020-07-29 01:32:32,281 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:32:32,298 INFO L624 ElimStorePlain]: treesize reduction 41, result has 33.9 percent of original size [2020-07-29 01:32:32,300 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:32:32,300 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:90, output treesize:18 [2020-07-29 01:32:32,307 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:32:32,308 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_63|, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_~z~0.offset, |v_ULTIMATE.start_main_#t~nondet19_6|]. (and (= |#memory_int| (let ((.cse0 (let ((.cse1 (store |v_#memory_int_63| ULTIMATE.start_main_~z~0.base (let ((.cse2 (select |v_#memory_int_63| ULTIMATE.start_main_~z~0.base))) (store .cse2 ULTIMATE.start_main_~z~0.offset (+ (select .cse2 ULTIMATE.start_main_~z~0.offset) (- 1))))))) (store .cse1 ULTIMATE.start_main_~x~0.base (store (select .cse1 ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset |v_ULTIMATE.start_main_#t~nondet19_6|))))) (store .cse0 ULTIMATE.start_main_~y~0.base (store (select .cse0 ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset (+ |v_ULTIMATE.start_main_#t~nondet19_6| (- 1)))))) (not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base))) [2020-07-29 01:32:32,308 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1))) [2020-07-29 01:32:32,403 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2020-07-29 01:32:32,428 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:32:32,435 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:32:32,442 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:32:32,442 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2020-07-29 01:32:32,445 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:32:32,445 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset]. (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) (.cse1 (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset))) (and (<= .cse0 |ULTIMATE.start_main_#t~mem14|) (<= |ULTIMATE.start_main_#t~mem13| .cse1) (not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base)) (= .cse0 (+ .cse1 1)))) [2020-07-29 01:32:32,446 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (+ |ULTIMATE.start_main_#t~mem13| 1) |ULTIMATE.start_main_#t~mem14|) [2020-07-29 01:32:32,446 INFO L280 TraceCheckUtils]: 0: Hoare triple {611#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {611#true} is VALID [2020-07-29 01:32:32,447 INFO L280 TraceCheckUtils]: 1: Hoare triple {611#true} 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; {613#(not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base))} is VALID [2020-07-29 01:32:32,448 INFO L280 TraceCheckUtils]: 2: Hoare triple {613#(not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base))} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; {613#(not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base))} is VALID [2020-07-29 01:32:32,448 INFO L280 TraceCheckUtils]: 3: Hoare triple {613#(not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base))} 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; {613#(not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base))} is VALID [2020-07-29 01:32:32,449 INFO L280 TraceCheckUtils]: 4: Hoare triple {613#(not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base))} main_#t~short12 := main_#t~short10; {613#(not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base))} is VALID [2020-07-29 01:32:32,449 INFO L280 TraceCheckUtils]: 5: Hoare triple {613#(not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base))} 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; {613#(not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base))} is VALID [2020-07-29 01:32:32,450 INFO L280 TraceCheckUtils]: 6: Hoare triple {613#(not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base))} assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem11;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;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); {613#(not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base))} is VALID [2020-07-29 01:32:32,451 INFO L280 TraceCheckUtils]: 7: Hoare triple {613#(not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base))} assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;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; {640#(and (not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1)))} is VALID [2020-07-29 01:32:32,452 INFO L280 TraceCheckUtils]: 8: Hoare triple {640#(and (not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1)))} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; {640#(and (not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1)))} is VALID [2020-07-29 01:32:32,453 INFO L280 TraceCheckUtils]: 9: Hoare triple {640#(and (not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 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; {640#(and (not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1)))} is VALID [2020-07-29 01:32:32,454 INFO L280 TraceCheckUtils]: 10: Hoare triple {640#(and (not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1)))} main_#t~short12 := main_#t~short10; {640#(and (not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1)))} is VALID [2020-07-29 01:32:32,454 INFO L280 TraceCheckUtils]: 11: Hoare triple {640#(and (not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1)))} 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; {640#(and (not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1)))} is VALID [2020-07-29 01:32:32,455 INFO L280 TraceCheckUtils]: 12: Hoare triple {640#(and (not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1)))} assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem11;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;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); {615#(<= (+ |ULTIMATE.start_main_#t~mem13| 1) |ULTIMATE.start_main_#t~mem14|)} is VALID [2020-07-29 01:32:32,459 INFO L280 TraceCheckUtils]: 13: Hoare triple {615#(<= (+ |ULTIMATE.start_main_#t~mem13| 1) |ULTIMATE.start_main_#t~mem14|)} assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem14;havoc main_#t~mem13;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; {612#false} is VALID [2020-07-29 01:32:32,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:32:32,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:32:32,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-07-29 01:32:32,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339539424] [2020-07-29 01:32:32,667 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2020-07-29 01:32:32,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:32:32,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:32:32,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:32:32,739 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 6 states. [2020-07-29 01:32:32,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:32:32,889 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-07-29 01:32:32,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:32:32,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:32:32,927 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:32:32,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2020-07-29 01:32:32,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:32:32,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2020-07-29 01:32:32,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 01:32:32,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 01:32:32,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2020-07-29 01:32:32,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:32:32,931 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-07-29 01:32:32,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2020-07-29 01:32:32,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2020-07-29 01:32:32,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:32:32,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 22 transitions. Second operand 15 states. [2020-07-29 01:32:32,933 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 22 transitions. Second operand 15 states. [2020-07-29 01:32:32,933 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 15 states. [2020-07-29 01:32:32,933 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:32,935 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-07-29 01:32:32,935 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2020-07-29 01:32:32,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:32,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:32,936 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 20 states and 22 transitions. [2020-07-29 01:32:32,936 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 20 states and 22 transitions. [2020-07-29 01:32:32,936 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:32,938 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-07-29 01:32:32,938 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2020-07-29 01:32:32,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:32,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:32,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:32:32,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:32:32,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 01:32:32,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2020-07-29 01:32:32,940 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-07-29 01:32:32,940 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-07-29 01:32:32,940 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:32:32,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2020-07-29 01:32:32,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:32:32,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:32,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:32,942 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:32:32,942 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:32:32,942 INFO L794 eck$LassoCheckResult]: Stem: 690#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 682#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; 683#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 685#L554-1 [2020-07-29 01:32:32,943 INFO L796 eck$LassoCheckResult]: Loop: 685#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; 688#L554-3 main_#t~short12 := main_#t~short10; 691#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; 678#L554-6 assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem11;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;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); 679#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;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; 684#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 685#L554-1 [2020-07-29 01:32:32,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:32,943 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2020-07-29 01:32:32,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:32,944 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916051927] [2020-07-29 01:32:32,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:32,954 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:32,963 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:32,966 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:32,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:32,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1187255894, now seen corresponding path program 1 times [2020-07-29 01:32:32,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:32,967 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324906394] [2020-07-29 01:32:32,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:32,981 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:32,994 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:33,002 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:33,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:33,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450553, now seen corresponding path program 2 times [2020-07-29 01:32:33,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:33,005 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881889273] [2020-07-29 01:32:33,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:33,034 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:33,069 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:33,078 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:33,361 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2020-07-29 01:32:33,798 WARN L193 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2020-07-29 01:32:34,300 WARN L193 SmtUtils]: Spent 448.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-07-29 01:32:34,306 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:32:34,307 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:32:34,307 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:32:34,307 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:32:34,307 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:32:34,307 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:34,307 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:32:34,308 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:32:34,308 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca.i_Iteration5_Lasso [2020-07-29 01:32:34,308 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:32:34,308 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:32:34,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:34,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:34,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:34,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:34,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:34,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:34,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:34,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:34,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:34,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:34,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:34,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:34,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:34,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:34,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:34,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:34,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:34,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:34,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:34,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:34,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:34,624 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-07-29 01:32:35,249 WARN L193 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2020-07-29 01:32:35,459 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2020-07-29 01:32:35,463 WARN L257 bleTransFormulaUtils]: 6 quantified variables [2020-07-29 01:32:35,464 WARN L257 bleTransFormulaUtils]: 6 quantified variables [2020-07-29 01:32:36,061 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2020-07-29 01:32:36,217 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-07-29 01:32:36,525 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2020-07-29 01:32:36,707 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2020-07-29 01:32:36,874 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:32:36,874 INFO L489 LassoAnalysis]: Using template 'affine'. 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 [2020-07-29 01:32:36,882 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 [2020-07-29 01:32:36,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:36,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:36,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:36,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:36,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:36,884 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:36,884 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:36,885 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 [2020-07-29 01:32:36,908 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 [2020-07-29 01:32:36,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:36,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:36,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:36,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:36,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:36,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:36,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:36,916 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 [2020-07-29 01:32:36,948 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 [2020-07-29 01:32:36,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:36,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:36,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:36,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:36,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:36,950 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:36,950 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:36,952 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 [2020-07-29 01:32:36,975 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 [2020-07-29 01:32:36,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:36,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:36,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:36,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:36,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:36,979 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:36,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:36,980 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 [2020-07-29 01:32:37,023 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 [2020-07-29 01:32:37,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:37,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:37,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:37,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:37,030 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:37,030 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:37,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:37,063 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 [2020-07-29 01:32:37,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:37,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:37,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:37,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:37,066 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:37,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:37,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:37,098 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 [2020-07-29 01:32:37,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:37,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:37,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:37,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:37,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:37,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:37,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:37,102 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) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:37,124 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 [2020-07-29 01:32:37,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:37,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:37,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:37,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:37,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:37,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:37,130 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:37,153 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 [2020-07-29 01:32:37,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:37,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:37,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:37,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:37,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:37,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:37,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:37,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:37,179 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 [2020-07-29 01:32:37,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:37,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:37,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:37,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:37,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:37,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:37,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:37,182 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 [2020-07-29 01:32:37,205 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 [2020-07-29 01:32:37,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:37,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:37,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:37,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:37,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:37,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:37,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:37,209 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) [2020-07-29 01:32:37,231 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 [2020-07-29 01:32:37,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:37,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:37,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:37,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:37,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:37,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:37,237 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 [2020-07-29 01:32:37,260 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 [2020-07-29 01:32:37,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:37,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:37,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:37,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:37,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:37,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:37,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:37,264 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 [2020-07-29 01:32:37,285 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 [2020-07-29 01:32:37,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:37,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:37,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:37,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:37,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:37,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:37,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:37,290 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) [2020-07-29 01:32:37,314 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 [2020-07-29 01:32:37,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:37,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:37,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:37,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:37,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:37,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:37,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:37,319 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) [2020-07-29 01:32:37,353 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 [2020-07-29 01:32:37,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:37,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:37,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:37,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:37,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:37,356 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:37,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:37,358 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 [2020-07-29 01:32:37,385 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 [2020-07-29 01:32:37,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:37,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:37,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:37,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:37,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:37,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:37,396 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 [2020-07-29 01:32:37,428 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 [2020-07-29 01:32:37,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:37,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:37,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:37,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:37,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:37,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:37,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:37,432 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) [2020-07-29 01:32:37,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:37,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:37,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:37,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:37,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:37,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:37,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:37,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:37,459 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 [2020-07-29 01:32:37,482 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 [2020-07-29 01:32:37,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:37,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:37,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:37,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:37,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:37,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:37,489 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 [2020-07-29 01:32:37,519 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 [2020-07-29 01:32:37,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:37,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:37,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:37,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:37,528 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:37,529 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:37,543 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 [2020-07-29 01:32:37,564 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 [2020-07-29 01:32:37,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:37,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:37,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:37,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:37,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:37,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:37,575 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 [2020-07-29 01:32:37,601 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 [2020-07-29 01:32:37,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:37,603 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-07-29 01:32:37,604 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:32:37,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:37,625 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2020-07-29 01:32:37,625 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 01:32:37,666 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:32:37,710 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-07-29 01:32:37,710 INFO L444 ModelExtractionUtils]: 19 out of 36 variables were initially zero. Simplification set additionally 15 variables to zero. 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) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:37,712 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:32:37,715 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2020-07-29 01:32:37,716 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:32:37,716 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 [] [2020-07-29 01:32:37,850 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2020-07-29 01:32:37,858 INFO L393 LassoCheck]: Loop: "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;" "main_#t~short12 := main_#t~short10;" "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;" "assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem11;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;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);" "assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;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;" "call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0;" [2020-07-29 01:32:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:37,866 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:32:37,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:37,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:32:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:37,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:37,928 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2020-07-29 01:32:37,937 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:32:37,943 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:32:37,943 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:32:37,944 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:10 [2020-07-29 01:32:37,946 INFO L280 TraceCheckUtils]: 0: Hoare triple {782#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {782#unseeded} is VALID [2020-07-29 01:32:37,949 INFO L280 TraceCheckUtils]: 1: Hoare triple {782#unseeded} 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; {917#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:32:37,950 INFO L280 TraceCheckUtils]: 2: Hoare triple {917#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; {917#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:32:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:37,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:32:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:37,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:37,979 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:32:38,126 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:32:38,126 INFO L384 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 [2020-07-29 01:32:38,130 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:32:38,168 INFO L624 ElimStorePlain]: treesize reduction 18, result has 73.1 percent of original size [2020-07-29 01:32:38,172 INFO L544 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. [2020-07-29 01:32:38,172 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:108, output treesize:42 [2020-07-29 01:32:38,180 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:32:38,181 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_123|, ULTIMATE.start_main_~x~0.offset, |v_ULTIMATE.start_main_#t~nondet19_11|, ULTIMATE.start_main_~y~0.offset]. (let ((.cse3 (select |v_#memory_int_123| ULTIMATE.start_main_~z~0.base))) (let ((.cse0 (select .cse3 ULTIMATE.start_main_~z~0.offset))) (and (<= .cse0 oldRank0) (= |#memory_int| (let ((.cse1 (let ((.cse2 (store |v_#memory_int_123| ULTIMATE.start_main_~z~0.base (store .cse3 ULTIMATE.start_main_~z~0.offset (+ .cse0 (- 1)))))) (store .cse2 ULTIMATE.start_main_~x~0.base (store (select .cse2 ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset |v_ULTIMATE.start_main_#t~nondet19_11|))))) (store .cse1 ULTIMATE.start_main_~y~0.base (store (select .cse1 ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset (+ |v_ULTIMATE.start_main_#t~nondet19_11| (- 1)))))) (<= 1 .cse0) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base))))) [2020-07-29 01:32:38,181 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~y~0.offset]. (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset))) (and (or (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base) (= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1))) (<= (+ .cse0 1) oldRank0) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= 0 .cse0))) [2020-07-29 01:32:38,226 INFO L280 TraceCheckUtils]: 0: Hoare triple {918#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} 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; {918#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} is VALID [2020-07-29 01:32:38,227 INFO L280 TraceCheckUtils]: 1: Hoare triple {918#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} main_#t~short12 := main_#t~short10; {918#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} is VALID [2020-07-29 01:32:38,229 INFO L280 TraceCheckUtils]: 2: Hoare triple {918#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} 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; {938#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) oldRank0) (or (<= 1 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not |ULTIMATE.start_main_#t~short12|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} is VALID [2020-07-29 01:32:38,229 INFO L280 TraceCheckUtils]: 3: Hoare triple {938#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) oldRank0) (or (<= 1 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not |ULTIMATE.start_main_#t~short12|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem11;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;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); {942#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) oldRank0) (<= 1 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} is VALID [2020-07-29 01:32:38,231 INFO L280 TraceCheckUtils]: 4: Hoare triple {942#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) oldRank0) (<= 1 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;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; {946#(and (or (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base) (exists ((ULTIMATE.start_main_~x~0.offset Int) (ULTIMATE.start_main_~y~0.offset Int)) (= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1)))) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) 1) oldRank0) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= 0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} is VALID [2020-07-29 01:32:38,238 INFO L280 TraceCheckUtils]: 5: Hoare triple {946#(and (or (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base) (exists ((ULTIMATE.start_main_~x~0.offset Int) (ULTIMATE.start_main_~y~0.offset Int)) (= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1)))) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) 1) oldRank0) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= 0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; {920#(and (or (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset))) unseeded) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} is VALID [2020-07-29 01:32:38,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:32:38,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:32:38,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:32:38,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 3 letters. Loop has 6 letters. [2020-07-29 01:32:38,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,258 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 [2020-07-29 01:32:38,258 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 7 states. [2020-07-29 01:32:38,378 INFO L75 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. [2020-07-29 01:32:38,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:32:38,378 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:38,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. cyclomatic complexity: 4 [2020-07-29 01:32:38,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:38,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:38,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:32:38,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:32:38,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:38,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:38,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 40 transitions. [2020-07-29 01:32:38,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:32:38,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:38,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:38,383 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 17 transitions. cyclomatic complexity: 4 [2020-07-29 01:32:38,384 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:32:38,384 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 01:32:38,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:32:38,385 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:32:38,385 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 40 transitions. cyclomatic complexity: 6 [2020-07-29 01:32:38,386 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:32:38,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 6 letters. [2020-07-29 01:32:38,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 3 letters. Loop has 6 letters. [2020-07-29 01:32:38,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 40 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 6 letters. [2020-07-29 01:32:38,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:32:38,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:32:38,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 40 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:32:38,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:38,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:38,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 40 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:38,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 37 letters. Loop has 37 letters. [2020-07-29 01:32:38,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 37 letters. Loop has 37 letters. [2020-07-29 01:32:38,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 40 transitions. cyclomatic complexity: 6 Stem has 37 letters. Loop has 37 letters. [2020-07-29 01:32:38,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:32:38,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:32:38,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 40 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:32:38,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:32:38,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:32:38,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 40 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:32:38,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:32:38,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:32:38,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 40 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:32:38,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 6 letters. [2020-07-29 01:32:38,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 6 letters. [2020-07-29 01:32:38,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 40 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 6 letters. [2020-07-29 01:32:38,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:32:38,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:32:38,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 40 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:32:38,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 6 letters. [2020-07-29 01:32:38,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 6 letters. [2020-07-29 01:32:38,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 40 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 6 letters. [2020-07-29 01:32:38,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:32:38,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:32:38,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 40 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:32:38,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 6 letters. [2020-07-29 01:32:38,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 3 letters. Loop has 6 letters. [2020-07-29 01:32:38,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 40 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 6 letters. [2020-07-29 01:32:38,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:32:38,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:32:38,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 40 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:32:38,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:32:38,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:32:38,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 40 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:32:38,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:32:38,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:32:38,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 40 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:32:38,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:32:38,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:32:38,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 40 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:32:38,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:32:38,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:32:38,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 40 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:32:38,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 6 letters. [2020-07-29 01:32:38,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 01:32:38,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 40 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 6 letters. [2020-07-29 01:32:38,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:38,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:38,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 40 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:38,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,410 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:38,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:32:38,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2020-07-29 01:32:38,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 3 letters. Loop has 6 letters. [2020-07-29 01:32:38,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:38,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 3 letters. Loop has 12 letters. [2020-07-29 01:32:38,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:38,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 40 transitions. cyclomatic complexity: 6 [2020-07-29 01:32:38,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:32:38,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 20 states and 21 transitions. [2020-07-29 01:32:38,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:32:38,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 01:32:38,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2020-07-29 01:32:38,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:32:38,415 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-07-29 01:32:38,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2020-07-29 01:32:38,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2020-07-29 01:32:38,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:32:38,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 21 transitions. Second operand 15 states. [2020-07-29 01:32:38,417 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 21 transitions. Second operand 15 states. [2020-07-29 01:32:38,417 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 15 states. [2020-07-29 01:32:38,418 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:38,419 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-29 01:32:38,419 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-29 01:32:38,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:38,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:38,420 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 20 states and 21 transitions. [2020-07-29 01:32:38,420 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 20 states and 21 transitions. [2020-07-29 01:32:38,421 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:38,422 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-29 01:32:38,423 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-29 01:32:38,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:38,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:38,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:32:38,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:32:38,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 01:32:38,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-29 01:32:38,424 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-29 01:32:38,424 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-29 01:32:38,424 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:32:38,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2020-07-29 01:32:38,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:32:38,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:38,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:38,425 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:32:38,425 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:32:38,426 INFO L794 eck$LassoCheckResult]: Stem: 1014#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1007#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; 1008#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 1011#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; 1012#L554-3 main_#t~short12 := main_#t~short10; 1016#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; 1005#L554-6 assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem11;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;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); 1006#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem14;havoc main_#t~mem13;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; 1013#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 1009#L554-1 [2020-07-29 01:32:38,426 INFO L796 eck$LassoCheckResult]: Loop: 1009#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; 1010#L554-3 main_#t~short12 := main_#t~short10; 1015#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; 1003#L554-6 assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem11;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;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); 1004#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;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; 1017#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 1009#L554-1 [2020-07-29 01:32:38,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:38,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450491, now seen corresponding path program 2 times [2020-07-29 01:32:38,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:38,427 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306764904] [2020-07-29 01:32:38,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:38,445 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:38,460 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:38,464 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:38,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:38,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1187255894, now seen corresponding path program 2 times [2020-07-29 01:32:38,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:38,465 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387566570] [2020-07-29 01:32:38,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:38,474 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:38,480 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:38,482 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:38,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:38,483 INFO L82 PathProgramCache]: Analyzing trace with hash 816748368, now seen corresponding path program 2 times [2020-07-29 01:32:38,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:38,484 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293788874] [2020-07-29 01:32:38,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:38,502 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:38,522 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:38,527 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:38,855 WARN L193 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2020-07-29 01:32:39,678 WARN L193 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 120 [2020-07-29 01:32:42,072 WARN L193 SmtUtils]: Spent 2.29 s on a formula simplification that was a NOOP. DAG size: 128 [2020-07-29 01:32:42,080 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:32:42,080 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:32:42,080 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:32:42,080 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:32:42,080 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:32:42,081 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:42,081 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:32:42,081 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:32:42,081 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca.i_Iteration6_Lasso [2020-07-29 01:32:42,081 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:32:42,081 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:32:42,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:42,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:42,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:42,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:42,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:42,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:42,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:42,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:42,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:42,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:42,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:42,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:42,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:42,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:42,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:42,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:42,676 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 35 [2020-07-29 01:32:43,418 WARN L193 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2020-07-29 01:32:43,617 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2020-07-29 01:32:43,620 WARN L257 bleTransFormulaUtils]: 8 quantified variables [2020-07-29 01:32:43,621 WARN L257 bleTransFormulaUtils]: 8 quantified variables [2020-07-29 01:32:43,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:43,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:43,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:43,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:44,160 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2020-07-29 01:32:44,675 WARN L193 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 63 [2020-07-29 01:32:44,774 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2020-07-29 01:32:45,318 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2020-07-29 01:32:45,505 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2020-07-29 01:32:45,608 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:32:45,608 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:45,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:45,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:45,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:45,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:45,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:45,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:45,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:45,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:45,615 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) [2020-07-29 01:32:45,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:45,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:45,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:45,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:45,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:45,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:45,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:45,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:45,641 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:45,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 [2020-07-29 01:32:45,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:45,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:45,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:45,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:45,666 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:45,666 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:45,669 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) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:45,698 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 [2020-07-29 01:32:45,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:45,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:45,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:45,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:45,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:45,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:45,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:45,702 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 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 [2020-07-29 01:32:45,725 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 [2020-07-29 01:32:45,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:45,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:45,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:45,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:45,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:45,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:45,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:45,728 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:45,749 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 [2020-07-29 01:32:45,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:45,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:45,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:45,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:45,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:45,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:45,754 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:45,777 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 [2020-07-29 01:32:45,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:45,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:45,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:45,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:45,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:45,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:45,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:45,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:45,803 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 [2020-07-29 01:32:45,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:45,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:45,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:45,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:45,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:45,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:45,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:45,806 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:45,829 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 [2020-07-29 01:32:45,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:45,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:45,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:45,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:45,831 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:45,831 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:45,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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:45,856 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 [2020-07-29 01:32:45,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:45,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:45,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:45,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:45,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:45,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:45,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:45,859 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:45,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:45,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:45,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:45,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:45,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:45,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:45,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:45,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:45,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:45,911 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 [2020-07-29 01:32:45,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:45,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:45,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:45,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:45,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:45,913 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:45,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:45,915 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:45,937 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 [2020-07-29 01:32:45,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:45,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:45,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:45,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:45,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:45,939 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:45,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:45,940 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 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:45,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:45,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:45,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:45,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:45,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:45,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:45,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:45,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:45,965 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 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:45,988 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 [2020-07-29 01:32:45,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:45,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:45,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:45,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:45,990 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:45,991 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:45,994 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 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:46,017 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 [2020-07-29 01:32:46,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:46,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:46,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:46,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:46,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:46,020 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:46,026 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 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:46,048 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 [2020-07-29 01:32:46,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:46,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:46,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:46,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:46,051 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:46,051 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:46,057 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 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:46,079 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 [2020-07-29 01:32:46,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:46,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:46,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:46,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:46,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:46,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:46,094 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 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:46,115 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 [2020-07-29 01:32:46,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:46,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:46,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:46,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:46,117 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:46,117 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:46,120 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 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:46,145 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 [2020-07-29 01:32:46,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:46,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:46,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:46,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:46,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:46,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:46,150 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 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:46,172 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 [2020-07-29 01:32:46,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:46,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:46,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:46,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:46,180 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:46,180 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:46,197 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 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:46,219 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 [2020-07-29 01:32:46,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:46,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:46,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:46,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:46,222 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:46,222 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:46,229 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 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:46,260 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 [2020-07-29 01:32:46,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:46,261 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-07-29 01:32:46,261 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:32:46,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:46,285 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2020-07-29 01:32:46,285 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 01:32:46,335 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:32:46,376 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 01:32:46,376 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 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:46,378 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:32:46,381 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2020-07-29 01:32:46,381 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:32:46,381 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 [] [2020-07-29 01:32:46,548 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2020-07-29 01:32:46,555 INFO L393 LassoCheck]: Loop: "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;" "main_#t~short12 := main_#t~short10;" "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;" "assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem11;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;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);" "assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;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;" "call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0;" [2020-07-29 01:32:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:46,564 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:32:46,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:46,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:32:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:46,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:46,645 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2020-07-29 01:32:46,647 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:32:46,652 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:32:46,652 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:32:46,653 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:10 [2020-07-29 01:32:46,670 INFO L280 TraceCheckUtils]: 0: Hoare triple {1139#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1139#unseeded} is VALID [2020-07-29 01:32:46,673 INFO L280 TraceCheckUtils]: 1: Hoare triple {1139#unseeded} 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; {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:32:46,675 INFO L280 TraceCheckUtils]: 2: Hoare triple {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:32:46,676 INFO L280 TraceCheckUtils]: 3: Hoare triple {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} 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; {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:32:46,677 INFO L280 TraceCheckUtils]: 4: Hoare triple {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} main_#t~short12 := main_#t~short10; {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:32:46,677 INFO L280 TraceCheckUtils]: 5: Hoare triple {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} 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; {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:32:46,678 INFO L280 TraceCheckUtils]: 6: Hoare triple {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem11;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;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); {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:32:46,679 INFO L280 TraceCheckUtils]: 7: Hoare triple {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem14;havoc main_#t~mem13;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; {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:32:46,681 INFO L280 TraceCheckUtils]: 8: Hoare triple {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:32:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:46,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:32:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:46,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:46,725 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:32:46,870 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:32:46,871 INFO L384 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 [2020-07-29 01:32:46,877 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:32:46,922 INFO L624 ElimStorePlain]: treesize reduction 18, result has 73.1 percent of original size [2020-07-29 01:32:46,926 INFO L544 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. [2020-07-29 01:32:46,926 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:108, output treesize:42 [2020-07-29 01:32:46,933 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:32:46,933 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_182|, ULTIMATE.start_main_~x~0.offset, |v_ULTIMATE.start_main_#t~nondet19_16|, ULTIMATE.start_main_~y~0.offset]. (let ((.cse2 (select |v_#memory_int_182| ULTIMATE.start_main_~z~0.base))) (let ((.cse3 (select .cse2 ULTIMATE.start_main_~z~0.offset))) (and (= (let ((.cse0 (let ((.cse1 (store |v_#memory_int_182| ULTIMATE.start_main_~z~0.base (store .cse2 ULTIMATE.start_main_~z~0.offset (+ .cse3 (- 1)))))) (store .cse1 ULTIMATE.start_main_~x~0.base (store (select .cse1 ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset |v_ULTIMATE.start_main_#t~nondet19_16|))))) (store .cse0 ULTIMATE.start_main_~y~0.base (store (select .cse0 ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset (+ |v_ULTIMATE.start_main_#t~nondet19_16| (- 1))))) |#memory_int|) (<= 1 .cse3) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= .cse3 oldRank0)))) [2020-07-29 01:32:46,934 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~y~0.offset]. (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset))) (and (or (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base) (= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1))) (<= (+ .cse0 1) oldRank0) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= 0 .cse0))) [2020-07-29 01:32:46,971 INFO L280 TraceCheckUtils]: 0: Hoare triple {1275#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} 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; {1275#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} is VALID [2020-07-29 01:32:46,972 INFO L280 TraceCheckUtils]: 1: Hoare triple {1275#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} main_#t~short12 := main_#t~short10; {1275#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} is VALID [2020-07-29 01:32:46,973 INFO L280 TraceCheckUtils]: 2: Hoare triple {1275#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} 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; {1313#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) oldRank0) (or (<= 1 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not |ULTIMATE.start_main_#t~short12|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} is VALID [2020-07-29 01:32:46,974 INFO L280 TraceCheckUtils]: 3: Hoare triple {1313#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) oldRank0) (or (<= 1 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not |ULTIMATE.start_main_#t~short12|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem11;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;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); {1317#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) oldRank0) (<= 1 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} is VALID [2020-07-29 01:32:46,982 INFO L280 TraceCheckUtils]: 4: Hoare triple {1317#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) oldRank0) (<= 1 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;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; {1321#(and (or (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base) (exists ((ULTIMATE.start_main_~x~0.offset Int) (ULTIMATE.start_main_~y~0.offset Int)) (= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1)))) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) 1) oldRank0) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= 0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} is VALID [2020-07-29 01:32:46,983 INFO L280 TraceCheckUtils]: 5: Hoare triple {1321#(and (or (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base) (exists ((ULTIMATE.start_main_~x~0.offset Int) (ULTIMATE.start_main_~y~0.offset Int)) (= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1)))) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) 1) oldRank0) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= 0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; {1277#(and (or (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset))) unseeded) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} is VALID [2020-07-29 01:32:46,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:32:46,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:32:47,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:32:47,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,011 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 [2020-07-29 01:32:47,011 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2020-07-29 01:32:47,130 INFO L75 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. [2020-07-29 01:32:47,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:32:47,130 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:47,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. cyclomatic complexity: 3 [2020-07-29 01:32:47,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:47,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:47,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:32:47,132 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:32:47,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:32:47,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 25 transitions. [2020-07-29 01:32:47,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:32:47,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:47,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:47,133 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 16 transitions. cyclomatic complexity: 3 [2020-07-29 01:32:47,134 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:32:47,134 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 01:32:47,135 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:32:47,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. cyclomatic complexity: 3 [2020-07-29 01:32:47,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:32:47,136 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:32:47,136 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 25 transitions. cyclomatic complexity: 3 [2020-07-29 01:32:47,138 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:32:47,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:32:47,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:32:47,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:32:47,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:32:47,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:32:47,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:32:47,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:32:47,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:32:47,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:32:47,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:32:47,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:32:47,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:32:47,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:32:47,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:32:47,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:32:47,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 14 letters. Loop has 6 letters. [2020-07-29 01:32:47,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 01:32:47,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 14 letters. Loop has 6 letters. [2020-07-29 01:32:47,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:32:47,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:32:47,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:32:47,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:32:47,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:32:47,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:32:47,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:32:47,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:32:47,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:32:47,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:32:47,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:32:47,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:32:47,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 14 letters. Loop has 6 letters. [2020-07-29 01:32:47,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 01:32:47,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 14 letters. Loop has 6 letters. [2020-07-29 01:32:47,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:32:47,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:32:47,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:32:47,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:32:47,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:32:47,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:32:47,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,152 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:47,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:32:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2020-07-29 01:32:47,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,154 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:32:47,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:47,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:32:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:47,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:47,221 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2020-07-29 01:32:47,225 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:32:47,229 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:32:47,230 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:32:47,230 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:10 [2020-07-29 01:32:47,248 INFO L280 TraceCheckUtils]: 0: Hoare triple {1139#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1139#unseeded} is VALID [2020-07-29 01:32:47,251 INFO L280 TraceCheckUtils]: 1: Hoare triple {1139#unseeded} 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; {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:32:47,252 INFO L280 TraceCheckUtils]: 2: Hoare triple {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:32:47,253 INFO L280 TraceCheckUtils]: 3: Hoare triple {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} 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; {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:32:47,254 INFO L280 TraceCheckUtils]: 4: Hoare triple {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} main_#t~short12 := main_#t~short10; {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:32:47,254 INFO L280 TraceCheckUtils]: 5: Hoare triple {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} 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; {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:32:47,255 INFO L280 TraceCheckUtils]: 6: Hoare triple {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem11;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;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); {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:32:47,256 INFO L280 TraceCheckUtils]: 7: Hoare triple {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem14;havoc main_#t~mem13;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; {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:32:47,257 INFO L280 TraceCheckUtils]: 8: Hoare triple {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:32:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:47,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:32:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:47,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:47,292 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:32:47,436 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:32:47,437 INFO L384 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 [2020-07-29 01:32:47,448 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:32:47,496 INFO L624 ElimStorePlain]: treesize reduction 18, result has 73.1 percent of original size [2020-07-29 01:32:47,500 INFO L544 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. [2020-07-29 01:32:47,500 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:108, output treesize:42 [2020-07-29 01:32:47,506 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:32:47,507 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_183|, ULTIMATE.start_main_~x~0.offset, |v_ULTIMATE.start_main_#t~nondet19_17|, ULTIMATE.start_main_~y~0.offset]. (let ((.cse3 (select |v_#memory_int_183| ULTIMATE.start_main_~z~0.base))) (let ((.cse0 (select .cse3 ULTIMATE.start_main_~z~0.offset))) (and (<= .cse0 oldRank0) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= 1 .cse0) (= |#memory_int| (let ((.cse1 (let ((.cse2 (store |v_#memory_int_183| ULTIMATE.start_main_~z~0.base (store .cse3 ULTIMATE.start_main_~z~0.offset (+ .cse0 (- 1)))))) (store .cse2 ULTIMATE.start_main_~x~0.base (store (select .cse2 ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset |v_ULTIMATE.start_main_#t~nondet19_17|))))) (store .cse1 ULTIMATE.start_main_~y~0.base (store (select .cse1 ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset (+ |v_ULTIMATE.start_main_#t~nondet19_17| (- 1))))))))) [2020-07-29 01:32:47,507 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~y~0.offset]. (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset))) (and (or (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base) (= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1))) (<= (+ .cse0 1) oldRank0) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= 0 .cse0))) [2020-07-29 01:32:47,548 INFO L280 TraceCheckUtils]: 0: Hoare triple {1275#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} 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; {1275#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} is VALID [2020-07-29 01:32:47,549 INFO L280 TraceCheckUtils]: 1: Hoare triple {1275#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} main_#t~short12 := main_#t~short10; {1275#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} is VALID [2020-07-29 01:32:47,551 INFO L280 TraceCheckUtils]: 2: Hoare triple {1275#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} 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; {1400#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) oldRank0) (or (<= 1 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not |ULTIMATE.start_main_#t~short12|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} is VALID [2020-07-29 01:32:47,552 INFO L280 TraceCheckUtils]: 3: Hoare triple {1400#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) oldRank0) (or (<= 1 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not |ULTIMATE.start_main_#t~short12|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem11;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;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); {1404#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) oldRank0) (<= 1 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} is VALID [2020-07-29 01:32:47,555 INFO L280 TraceCheckUtils]: 4: Hoare triple {1404#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) oldRank0) (<= 1 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;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; {1408#(and (or (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base) (exists ((ULTIMATE.start_main_~x~0.offset Int) (ULTIMATE.start_main_~y~0.offset Int)) (= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1)))) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) 1) oldRank0) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= 0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} is VALID [2020-07-29 01:32:47,557 INFO L280 TraceCheckUtils]: 5: Hoare triple {1408#(and (or (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base) (exists ((ULTIMATE.start_main_~x~0.offset Int) (ULTIMATE.start_main_~y~0.offset Int)) (= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1)))) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) 1) oldRank0) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= 0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; {1277#(and (or (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset))) unseeded) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} is VALID [2020-07-29 01:32:47,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:32:47,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:32:47,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:32:47,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,582 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 [2020-07-29 01:32:47,583 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2020-07-29 01:32:47,703 INFO L75 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. [2020-07-29 01:32:47,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:32:47,703 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:47,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. cyclomatic complexity: 3 [2020-07-29 01:32:47,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:47,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:47,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:32:47,704 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:32:47,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:32:47,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 25 transitions. [2020-07-29 01:32:47,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:32:47,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:47,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:47,706 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 16 transitions. cyclomatic complexity: 3 [2020-07-29 01:32:47,706 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:32:47,706 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 01:32:47,707 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:32:47,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. cyclomatic complexity: 3 [2020-07-29 01:32:47,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:32:47,707 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:32:47,707 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 25 transitions. cyclomatic complexity: 3 [2020-07-29 01:32:47,708 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:32:47,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:32:47,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:32:47,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:32:47,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:32:47,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:32:47,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:32:47,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:32:47,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:32:47,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:32:47,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:32:47,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:32:47,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:32:47,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:32:47,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:32:47,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:32:47,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 14 letters. Loop has 6 letters. [2020-07-29 01:32:47,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 01:32:47,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 14 letters. Loop has 6 letters. [2020-07-29 01:32:47,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:32:47,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:32:47,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:32:47,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:32:47,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:32:47,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:32:47,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:32:47,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:32:47,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:32:47,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:32:47,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:32:47,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:32:47,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:32:47,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:32:47,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:32:47,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:32:47,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:32:47,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:32:47,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 14 letters. Loop has 6 letters. [2020-07-29 01:32:47,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 01:32:47,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 3 Stem has 14 letters. Loop has 6 letters. [2020-07-29 01:32:47,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,728 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:47,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:32:47,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2020-07-29 01:32:47,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:47,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:47,730 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:32:47,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:47,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:32:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:47,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:47,805 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2020-07-29 01:32:47,808 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:32:47,814 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:32:47,815 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:32:47,815 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:10 [2020-07-29 01:32:47,817 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:32:47,817 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_186|]. (and (<= (select (store (store |v_#valid_186| ULTIMATE.start_main_~x~0.base 1) ULTIMATE.start_main_~y~0.base 1) ULTIMATE.start_main_~z~0.base) 0) unseeded) [2020-07-29 01:32:47,818 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) unseeded) [2020-07-29 01:32:47,842 INFO L280 TraceCheckUtils]: 0: Hoare triple {1139#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1139#unseeded} is VALID [2020-07-29 01:32:47,845 INFO L280 TraceCheckUtils]: 1: Hoare triple {1139#unseeded} 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; {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:32:47,846 INFO L280 TraceCheckUtils]: 2: Hoare triple {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:32:47,847 INFO L280 TraceCheckUtils]: 3: Hoare triple {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} 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; {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:32:47,847 INFO L280 TraceCheckUtils]: 4: Hoare triple {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} main_#t~short12 := main_#t~short10; {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:32:47,848 INFO L280 TraceCheckUtils]: 5: Hoare triple {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} 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; {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:32:47,849 INFO L280 TraceCheckUtils]: 6: Hoare triple {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem11;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;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); {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:32:47,850 INFO L280 TraceCheckUtils]: 7: Hoare triple {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem14;havoc main_#t~mem13;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; {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:32:47,851 INFO L280 TraceCheckUtils]: 8: Hoare triple {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; {1274#(and (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:32:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:47,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:32:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:47,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:47,883 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:32:48,052 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:32:48,052 INFO L384 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 [2020-07-29 01:32:48,055 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:32:48,103 INFO L624 ElimStorePlain]: treesize reduction 18, result has 73.1 percent of original size [2020-07-29 01:32:48,106 INFO L544 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. [2020-07-29 01:32:48,107 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:108, output treesize:42 [2020-07-29 01:32:48,114 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:32:48,115 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_184|, ULTIMATE.start_main_~x~0.offset, |v_ULTIMATE.start_main_#t~nondet19_18|, ULTIMATE.start_main_~y~0.offset]. (let ((.cse2 (select |v_#memory_int_184| ULTIMATE.start_main_~z~0.base))) (let ((.cse3 (select .cse2 ULTIMATE.start_main_~z~0.offset))) (and (= (let ((.cse0 (let ((.cse1 (store |v_#memory_int_184| ULTIMATE.start_main_~z~0.base (store .cse2 ULTIMATE.start_main_~z~0.offset (+ .cse3 (- 1)))))) (store .cse1 ULTIMATE.start_main_~x~0.base (store (select .cse1 ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset |v_ULTIMATE.start_main_#t~nondet19_18|))))) (store .cse0 ULTIMATE.start_main_~y~0.base (store (select .cse0 ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset (+ |v_ULTIMATE.start_main_#t~nondet19_18| (- 1))))) |#memory_int|) (<= 1 .cse3) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= .cse3 oldRank0)))) [2020-07-29 01:32:48,115 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~y~0.offset]. (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset))) (and (or (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base) (= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1))) (<= (+ .cse0 1) oldRank0) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= 0 .cse0))) [2020-07-29 01:32:48,162 INFO L280 TraceCheckUtils]: 0: Hoare triple {1275#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} 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; {1275#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} is VALID [2020-07-29 01:32:48,163 INFO L280 TraceCheckUtils]: 1: Hoare triple {1275#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} main_#t~short12 := main_#t~short10; {1275#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} is VALID [2020-07-29 01:32:48,166 INFO L280 TraceCheckUtils]: 2: Hoare triple {1275#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} 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; {1487#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) oldRank0) (or (<= 1 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not |ULTIMATE.start_main_#t~short12|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} is VALID [2020-07-29 01:32:48,167 INFO L280 TraceCheckUtils]: 3: Hoare triple {1487#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) oldRank0) (or (<= 1 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not |ULTIMATE.start_main_#t~short12|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem11;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;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); {1491#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) oldRank0) (<= 1 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} is VALID [2020-07-29 01:32:48,170 INFO L280 TraceCheckUtils]: 4: Hoare triple {1491#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) oldRank0) (<= 1 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;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; {1495#(and (or (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base) (exists ((ULTIMATE.start_main_~x~0.offset Int) (ULTIMATE.start_main_~y~0.offset Int)) (= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1)))) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) 1) oldRank0) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= 0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} is VALID [2020-07-29 01:32:48,172 INFO L280 TraceCheckUtils]: 5: Hoare triple {1495#(and (or (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~y~0.base) (exists ((ULTIMATE.start_main_~x~0.offset Int) (ULTIMATE.start_main_~y~0.offset Int)) (= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 1)))) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) 1) oldRank0) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= 0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)))} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; {1277#(and (or (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset))) unseeded) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~y~0.base)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} is VALID [2020-07-29 01:32:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:32:48,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:32:48,201 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:32:48,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:48,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,202 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 [2020-07-29 01:32:48,202 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2020-07-29 01:32:48,362 INFO L75 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. [2020-07-29 01:32:48,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:32:48,362 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:48,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. cyclomatic complexity: 3 [2020-07-29 01:32:48,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:48,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:48,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:32:48,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:32:48,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:48,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:48,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2020-07-29 01:32:48,365 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:32:48,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:32:48,366 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 16 transitions. cyclomatic complexity: 3 [2020-07-29 01:32:48,366 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:32:48,366 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 01:32:48,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:32:48,368 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:32:48,368 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 28 transitions. cyclomatic complexity: 4 [2020-07-29 01:32:48,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. cyclomatic complexity: 4 [2020-07-29 01:32:48,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:32:48,368 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:32:48,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:48,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:48,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 28 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:48,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:32:48,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:32:48,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 28 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:32:48,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 26 letters. Loop has 26 letters. [2020-07-29 01:32:48,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 26 letters. Loop has 26 letters. [2020-07-29 01:32:48,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 28 transitions. cyclomatic complexity: 4 Stem has 26 letters. Loop has 26 letters. [2020-07-29 01:32:48,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:32:48,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:32:48,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 28 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:32:48,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:32:48,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:32:48,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 28 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:32:48,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:48,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:48,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 28 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:48,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:32:48,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:32:48,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 28 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:32:48,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:32:48,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:32:48,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 28 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:32:48,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 14 letters. Loop has 6 letters. [2020-07-29 01:32:48,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 01:32:48,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 28 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 6 letters. [2020-07-29 01:32:48,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:32:48,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:32:48,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 28 transitions. cyclomatic complexity: 4 Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:32:48,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:32:48,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:32:48,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 28 transitions. cyclomatic complexity: 4 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:32:48,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 16 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:32:48,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:32:48,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 28 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:32:48,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,384 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:48,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:32:48,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2020-07-29 01:32:48,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:32:48,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 15 letters. Loop has 6 letters. [2020-07-29 01:32:48,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:32:48,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:48,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. cyclomatic complexity: 4 [2020-07-29 01:32:48,389 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:32:48,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2020-07-29 01:32:48,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:32:48,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:32:48,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:32:48,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:32:48,390 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:32:48,390 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:32:48,390 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:32:48,390 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:32:48,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:32:48,391 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:32:48,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:32:48,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:32:48 BoogieIcfgContainer [2020-07-29 01:32:48,398 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:32:48,398 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:32:48,398 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:32:48,399 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:32:48,399 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:32:25" (3/4) ... [2020-07-29 01:32:48,403 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:32:48,403 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:32:48,405 INFO L168 Benchmark]: Toolchain (without parser) took 23635.54 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 470.3 MB). Free memory was 960.2 MB in the beginning and 823.7 MB in the end (delta: 136.5 MB). Peak memory consumption was 606.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:48,406 INFO L168 Benchmark]: CDTParser took 1.09 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:32:48,406 INFO L168 Benchmark]: CACSL2BoogieTranslator took 586.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -172.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:48,407 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.44 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:48,407 INFO L168 Benchmark]: Boogie Preprocessor took 29.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:32:48,407 INFO L168 Benchmark]: RCFGBuilder took 497.34 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:48,408 INFO L168 Benchmark]: BuchiAutomizer took 22462.19 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 325.6 MB). Free memory was 1.1 GB in the beginning and 823.7 MB in the end (delta: 265.4 MB). Peak memory consumption was 591.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:48,408 INFO L168 Benchmark]: Witness Printer took 4.87 ms. Allocated memory is still 1.5 GB. Free memory is still 823.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:32:48,410 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.09 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 586.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -172.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.44 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 497.34 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22462.19 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 325.6 MB). Free memory was 1.1 GB in the beginning and 823.7 MB in the end (delta: 265.4 MB). Peak memory consumption was 591.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.87 ms. Allocated memory is still 1.5 GB. Free memory is still 823.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 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 22.4s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 18.8s. Construction of modules took 0.3s. Büchi inclusion checks took 3.0s. 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, 45 SDs, 0 SdLazy, 136 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital897 mio100 ax103 hnf99 lsp229 ukn33 mio100 lsp88 div100 bol105 ite100 ukn100 eq164 hnf94 smp56 dnf403 smp49 tf100 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 116ms VariablesStem: 11 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...