./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-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/Toulouse-MultiBranchesToLoop-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 7ed84bee4308b8cf5be51a33ec471886cd45cc40 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:33:00,632 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:33:00,635 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:33:00,648 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:33:00,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:33:00,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:33:00,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:33:00,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:33:00,656 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:33:00,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:33:00,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:33:00,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:33:00,660 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:33:00,661 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:33:00,662 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:33:00,664 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:33:00,665 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:33:00,666 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:33:00,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:33:00,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:33:00,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:33:00,673 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:33:00,675 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:33:00,676 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:33:00,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:33:00,679 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:33:00,679 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:33:00,681 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:33:00,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:33:00,682 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:33:00,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:33:00,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:33:00,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:33:00,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:33:00,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:33:00,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:33:00,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:33:00,689 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:33:00,689 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:33:00,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:33:00,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:33:00,692 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:33:00,709 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:33:00,709 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:33:00,710 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:33:00,711 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:33:00,711 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:33:00,711 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:33:00,712 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:33:00,712 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:33:00,712 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:33:00,713 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:33:00,713 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:33:00,713 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:33:00,713 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:33:00,714 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:33:00,714 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:33:00,714 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:33:00,715 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:33:00,715 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:33:00,715 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:33:00,715 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:33:00,716 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:33:00,716 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:33:00,716 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:33:00,717 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:33:00,717 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:33:00,717 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:33:00,718 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:33:00,718 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:33:00,718 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:33:00,719 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:33:00,720 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 -> 7ed84bee4308b8cf5be51a33ec471886cd45cc40 [2020-07-29 01:33:01,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:33:01,082 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:33:01,086 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:33:01,089 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:33:01,090 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:33:01,092 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca.i [2020-07-29 01:33:01,175 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/180d230ec/78b9e37d51464eb29a3c868ccd0d4f60/FLAGbfa475d9e [2020-07-29 01:33:01,683 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:33:01,684 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca.i [2020-07-29 01:33:01,697 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/180d230ec/78b9e37d51464eb29a3c868ccd0d4f60/FLAGbfa475d9e [2020-07-29 01:33:01,998 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/180d230ec/78b9e37d51464eb29a3c868ccd0d4f60 [2020-07-29 01:33:02,002 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:33:02,005 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:33:02,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:33:02,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:33:02,010 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:33:02,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:33:02" (1/1) ... [2020-07-29 01:33:02,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58af51cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:33:02, skipping insertion in model container [2020-07-29 01:33:02,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:33:02" (1/1) ... [2020-07-29 01:33:02,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:33:02,065 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:33:02,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:33:02,505 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:33:02,603 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:33:02,677 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:33:02,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:33:02 WrapperNode [2020-07-29 01:33:02,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:33:02,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:33:02,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:33:02,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:33:02,691 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:33:02" (1/1) ... [2020-07-29 01:33:02,710 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:33:02" (1/1) ... [2020-07-29 01:33:02,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:33:02,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:33:02,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:33:02,746 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:33:02,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:33:02" (1/1) ... [2020-07-29 01:33:02,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:33:02" (1/1) ... [2020-07-29 01:33:02,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:33:02" (1/1) ... [2020-07-29 01:33:02,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:33:02" (1/1) ... [2020-07-29 01:33:02,772 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:33:02" (1/1) ... [2020-07-29 01:33:02,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:33:02" (1/1) ... [2020-07-29 01:33:02,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:33:02" (1/1) ... [2020-07-29 01:33:02,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:33:02,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:33:02,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:33:02,798 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:33:02,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:33:02" (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:33:02,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:33:02,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:33:02,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:33:02,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:33:02,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:33:02,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:33:03,568 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:33:03,568 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-29 01:33:03,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:33:03 BoogieIcfgContainer [2020-07-29 01:33:03,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:33:03,574 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:33:03,574 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:33:03,578 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:33:03,579 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:33:03,579 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:33:02" (1/3) ... [2020-07-29 01:33:03,581 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b893e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:33:03, skipping insertion in model container [2020-07-29 01:33:03,581 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:33:03,581 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:33:02" (2/3) ... [2020-07-29 01:33:03,581 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b893e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:33:03, skipping insertion in model container [2020-07-29 01:33:03,582 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:33:03,582 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:33:03" (3/3) ... [2020-07-29 01:33:03,584 INFO L371 chiAutomizerObserver]: Analyzing ICFG Toulouse-MultiBranchesToLoop-alloca.i [2020-07-29 01:33:03,639 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:33:03,639 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:33:03,639 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:33:03,639 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:33:03,640 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:33:03,640 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:33:03,641 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:33:03,641 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:33:03,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2020-07-29 01:33:03,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:03,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:33:03,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:33:03,698 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:33:03,698 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:33:03,698 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:33:03,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2020-07-29 01:33:03,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:03,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:33:03,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:33:03,705 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:33:03,705 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:33:03,714 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 7#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 22#L553true assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 25#L553-2true call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 17#L558true assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; 19#L558-2true call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 9#L563true assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 13#L563-2true call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3#L568true assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 5#L568-2true call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 24#L573true assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; 27#L573-2true call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 18#L578true assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 21#L578-2true call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 11#L583true assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 16#L583-2true call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 4#L588true assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 6#L588-2true call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 26#L593true assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 10#L598-4true [2020-07-29 01:33:03,715 INFO L796 eck$LassoCheckResult]: Loop: 10#L598-4true call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 20#L598true assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 8#L598-2true assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 10#L598-4true [2020-07-29 01:33:03,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:03,722 INFO L82 PathProgramCache]: Analyzing trace with hash 187436106, now seen corresponding path program 1 times [2020-07-29 01:33:03,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:03,733 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289150065] [2020-07-29 01:33:03,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:33:04,221 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {30#true} is VALID [2020-07-29 01:33:04,222 INFO L280 TraceCheckUtils]: 1: Hoare triple {30#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; {30#true} is VALID [2020-07-29 01:33:04,224 INFO L280 TraceCheckUtils]: 2: Hoare triple {30#true} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); {32#(= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1))} is VALID [2020-07-29 01:33:04,226 INFO L280 TraceCheckUtils]: 3: Hoare triple {32#(= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1))} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); {33#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1) 0)} is VALID [2020-07-29 01:33:04,228 INFO L280 TraceCheckUtils]: 4: Hoare triple {33#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1) 0)} assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; {34#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0)} is VALID [2020-07-29 01:33:04,229 INFO L280 TraceCheckUtils]: 5: Hoare triple {34#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0)} call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); {34#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0)} is VALID [2020-07-29 01:33:04,232 INFO L280 TraceCheckUtils]: 6: Hoare triple {34#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0)} assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; {35#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 0)} is VALID [2020-07-29 01:33:04,233 INFO L280 TraceCheckUtils]: 7: Hoare triple {35#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 0)} call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); {35#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 0)} is VALID [2020-07-29 01:33:04,236 INFO L280 TraceCheckUtils]: 8: Hoare triple {35#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 0)} assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; {36#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 4) 0)} is VALID [2020-07-29 01:33:04,238 INFO L280 TraceCheckUtils]: 9: Hoare triple {36#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 4) 0)} call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); {36#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 4) 0)} is VALID [2020-07-29 01:33:04,239 INFO L280 TraceCheckUtils]: 10: Hoare triple {36#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 4) 0)} assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; {37#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 5) 0)} is VALID [2020-07-29 01:33:04,241 INFO L280 TraceCheckUtils]: 11: Hoare triple {37#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 5) 0)} call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); {37#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 5) 0)} is VALID [2020-07-29 01:33:04,244 INFO L280 TraceCheckUtils]: 12: Hoare triple {37#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 5) 0)} assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; {38#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 6) 0)} is VALID [2020-07-29 01:33:04,246 INFO L280 TraceCheckUtils]: 13: Hoare triple {38#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 6) 0)} call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); {39#(<= (+ |ULTIMATE.start_main_#t~mem33| 6) 0)} is VALID [2020-07-29 01:33:04,248 INFO L280 TraceCheckUtils]: 14: Hoare triple {39#(<= (+ |ULTIMATE.start_main_#t~mem33| 6) 0)} assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; {31#false} is VALID [2020-07-29 01:33:04,249 INFO L280 TraceCheckUtils]: 15: Hoare triple {31#false} call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); {31#false} is VALID [2020-07-29 01:33:04,249 INFO L280 TraceCheckUtils]: 16: Hoare triple {31#false} assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; {31#false} is VALID [2020-07-29 01:33:04,250 INFO L280 TraceCheckUtils]: 17: Hoare triple {31#false} call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); {31#false} is VALID [2020-07-29 01:33:04,250 INFO L280 TraceCheckUtils]: 18: Hoare triple {31#false} assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; {31#false} is VALID [2020-07-29 01:33:04,257 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:33:04,258 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289150065] [2020-07-29 01:33:04,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:33:04,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-29 01:33:04,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206603837] [2020-07-29 01:33:04,268 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:33:04,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:04,269 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 1 times [2020-07-29 01:33:04,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:04,270 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855795238] [2020-07-29 01:33:04,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:04,327 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:04,398 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:04,434 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:33:04,640 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-29 01:33:04,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:33:04,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:33:04,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:33:04,764 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 10 states. [2020-07-29 01:33:06,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:06,341 INFO L93 Difference]: Finished difference Result 101 states and 135 transitions. [2020-07-29 01:33:06,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:33:06,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:33:06,392 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:33:06,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 135 transitions. [2020-07-29 01:33:06,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:06,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 77 states and 111 transitions. [2020-07-29 01:33:06,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2020-07-29 01:33:06,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2020-07-29 01:33:06,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 111 transitions. [2020-07-29 01:33:06,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:33:06,419 INFO L688 BuchiCegarLoop]: Abstraction has 77 states and 111 transitions. [2020-07-29 01:33:06,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 111 transitions. [2020-07-29 01:33:06,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 34. [2020-07-29 01:33:06,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:33:06,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states and 111 transitions. Second operand 34 states. [2020-07-29 01:33:06,452 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states and 111 transitions. Second operand 34 states. [2020-07-29 01:33:06,454 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand 34 states. [2020-07-29 01:33:06,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:06,461 INFO L93 Difference]: Finished difference Result 77 states and 111 transitions. [2020-07-29 01:33:06,461 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2020-07-29 01:33:06,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:06,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:06,463 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 77 states and 111 transitions. [2020-07-29 01:33:06,464 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 77 states and 111 transitions. [2020-07-29 01:33:06,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:06,470 INFO L93 Difference]: Finished difference Result 77 states and 111 transitions. [2020-07-29 01:33:06,470 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2020-07-29 01:33:06,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:06,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:06,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:33:06,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:33:06,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-29 01:33:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2020-07-29 01:33:06,476 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 49 transitions. [2020-07-29 01:33:06,477 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 49 transitions. [2020-07-29 01:33:06,477 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:33:06,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 49 transitions. [2020-07-29 01:33:06,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:06,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:33:06,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:33:06,480 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:33:06,480 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:33:06,480 INFO L794 eck$LassoCheckResult]: Stem: 165#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 160#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 161#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 163#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 145#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; 146#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 166#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 167#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 147#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 148#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 155#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; 168#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 149#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 150#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 158#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 171#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 153#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 154#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 159#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 162#L598-4 [2020-07-29 01:33:06,480 INFO L796 eck$LassoCheckResult]: Loop: 162#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 156#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 157#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 162#L598-4 [2020-07-29 01:33:06,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:06,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1775784008, now seen corresponding path program 1 times [2020-07-29 01:33:06,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:06,482 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509284943] [2020-07-29 01:33:06,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:33:06,566 INFO L280 TraceCheckUtils]: 0: Hoare triple {336#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {336#true} is VALID [2020-07-29 01:33:06,567 INFO L280 TraceCheckUtils]: 1: Hoare triple {336#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; {336#true} is VALID [2020-07-29 01:33:06,569 INFO L280 TraceCheckUtils]: 2: Hoare triple {336#true} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); {338#(= 1 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:06,571 INFO L280 TraceCheckUtils]: 3: Hoare triple {338#(= 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); {339#(= |ULTIMATE.start_main_#t~mem8| 1)} is VALID [2020-07-29 01:33:06,572 INFO L280 TraceCheckUtils]: 4: Hoare triple {339#(= |ULTIMATE.start_main_#t~mem8| 1)} assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; {337#false} is VALID [2020-07-29 01:33:06,572 INFO L280 TraceCheckUtils]: 5: Hoare triple {337#false} call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); {337#false} is VALID [2020-07-29 01:33:06,573 INFO L280 TraceCheckUtils]: 6: Hoare triple {337#false} assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; {337#false} is VALID [2020-07-29 01:33:06,573 INFO L280 TraceCheckUtils]: 7: Hoare triple {337#false} call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); {337#false} is VALID [2020-07-29 01:33:06,573 INFO L280 TraceCheckUtils]: 8: Hoare triple {337#false} assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; {337#false} is VALID [2020-07-29 01:33:06,574 INFO L280 TraceCheckUtils]: 9: Hoare triple {337#false} call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); {337#false} is VALID [2020-07-29 01:33:06,574 INFO L280 TraceCheckUtils]: 10: Hoare triple {337#false} assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; {337#false} is VALID [2020-07-29 01:33:06,574 INFO L280 TraceCheckUtils]: 11: Hoare triple {337#false} call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); {337#false} is VALID [2020-07-29 01:33:06,574 INFO L280 TraceCheckUtils]: 12: Hoare triple {337#false} assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; {337#false} is VALID [2020-07-29 01:33:06,575 INFO L280 TraceCheckUtils]: 13: Hoare triple {337#false} call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); {337#false} is VALID [2020-07-29 01:33:06,575 INFO L280 TraceCheckUtils]: 14: Hoare triple {337#false} assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; {337#false} is VALID [2020-07-29 01:33:06,576 INFO L280 TraceCheckUtils]: 15: Hoare triple {337#false} call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); {337#false} is VALID [2020-07-29 01:33:06,576 INFO L280 TraceCheckUtils]: 16: Hoare triple {337#false} assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; {337#false} is VALID [2020-07-29 01:33:06,576 INFO L280 TraceCheckUtils]: 17: Hoare triple {337#false} call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); {337#false} is VALID [2020-07-29 01:33:06,577 INFO L280 TraceCheckUtils]: 18: Hoare triple {337#false} assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; {337#false} is VALID [2020-07-29 01:33:06,578 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:33:06,579 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509284943] [2020-07-29 01:33:06,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:33:06,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:33:06,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018082274] [2020-07-29 01:33:06,580 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:33:06,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:06,581 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 2 times [2020-07-29 01:33:06,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:06,581 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443082202] [2020-07-29 01:33:06,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:06,607 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:06,630 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:06,637 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:33:06,831 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-29 01:33:06,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:33:06,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:33:06,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:33:06,901 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. cyclomatic complexity: 16 Second operand 4 states. [2020-07-29 01:33:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:07,074 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2020-07-29 01:33:07,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:33:07,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:33:07,100 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:33:07,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 48 transitions. [2020-07-29 01:33:07,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:07,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 48 transitions. [2020-07-29 01:33:07,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2020-07-29 01:33:07,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2020-07-29 01:33:07,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 48 transitions. [2020-07-29 01:33:07,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:33:07,113 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 48 transitions. [2020-07-29 01:33:07,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 48 transitions. [2020-07-29 01:33:07,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-29 01:33:07,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:33:07,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states and 48 transitions. Second operand 34 states. [2020-07-29 01:33:07,118 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states and 48 transitions. Second operand 34 states. [2020-07-29 01:33:07,118 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 34 states. [2020-07-29 01:33:07,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:07,121 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2020-07-29 01:33:07,121 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2020-07-29 01:33:07,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:07,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:07,122 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states and 48 transitions. [2020-07-29 01:33:07,122 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states and 48 transitions. [2020-07-29 01:33:07,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:07,124 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2020-07-29 01:33:07,125 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2020-07-29 01:33:07,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:07,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:07,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:33:07,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:33:07,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-29 01:33:07,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2020-07-29 01:33:07,128 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 48 transitions. [2020-07-29 01:33:07,128 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 48 transitions. [2020-07-29 01:33:07,128 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:33:07,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 48 transitions. [2020-07-29 01:33:07,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:07,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:33:07,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:33:07,131 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:33:07,131 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:33:07,132 INFO L794 eck$LassoCheckResult]: Stem: 399#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 394#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 395#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 397#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 378#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 379#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 400#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 401#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 380#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 381#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 389#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; 403#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 407#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 383#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 406#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 405#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 387#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 388#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 393#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 396#L598-4 [2020-07-29 01:33:07,132 INFO L796 eck$LassoCheckResult]: Loop: 396#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 390#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 391#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 396#L598-4 [2020-07-29 01:33:07,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:07,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1239319610, now seen corresponding path program 1 times [2020-07-29 01:33:07,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:07,133 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426505173] [2020-07-29 01:33:07,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:33:07,227 INFO L280 TraceCheckUtils]: 0: Hoare triple {483#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {483#true} is VALID [2020-07-29 01:33:07,227 INFO L280 TraceCheckUtils]: 1: Hoare triple {483#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; {483#true} is VALID [2020-07-29 01:33:07,228 INFO L280 TraceCheckUtils]: 2: Hoare triple {483#true} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); {483#true} is VALID [2020-07-29 01:33:07,229 INFO L280 TraceCheckUtils]: 3: Hoare triple {483#true} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); {485#(= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) |ULTIMATE.start_main_#t~mem8|)} is VALID [2020-07-29 01:33:07,231 INFO L280 TraceCheckUtils]: 4: Hoare triple {485#(= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) |ULTIMATE.start_main_#t~mem8|)} assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; {486#(<= 2 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:07,231 INFO L280 TraceCheckUtils]: 5: Hoare triple {486#(<= 2 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); {486#(<= 2 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:07,232 INFO L280 TraceCheckUtils]: 6: Hoare triple {486#(<= 2 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; {487#(<= 1 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:07,233 INFO L280 TraceCheckUtils]: 7: Hoare triple {487#(<= 1 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); {488#(<= 1 |ULTIMATE.start_main_#t~mem18|)} is VALID [2020-07-29 01:33:07,233 INFO L280 TraceCheckUtils]: 8: Hoare triple {488#(<= 1 |ULTIMATE.start_main_#t~mem18|)} assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; {484#false} is VALID [2020-07-29 01:33:07,234 INFO L280 TraceCheckUtils]: 9: Hoare triple {484#false} call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); {484#false} is VALID [2020-07-29 01:33:07,234 INFO L280 TraceCheckUtils]: 10: Hoare triple {484#false} assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; {484#false} is VALID [2020-07-29 01:33:07,234 INFO L280 TraceCheckUtils]: 11: Hoare triple {484#false} call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); {484#false} is VALID [2020-07-29 01:33:07,234 INFO L280 TraceCheckUtils]: 12: Hoare triple {484#false} assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; {484#false} is VALID [2020-07-29 01:33:07,235 INFO L280 TraceCheckUtils]: 13: Hoare triple {484#false} call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); {484#false} is VALID [2020-07-29 01:33:07,235 INFO L280 TraceCheckUtils]: 14: Hoare triple {484#false} assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; {484#false} is VALID [2020-07-29 01:33:07,235 INFO L280 TraceCheckUtils]: 15: Hoare triple {484#false} call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); {484#false} is VALID [2020-07-29 01:33:07,235 INFO L280 TraceCheckUtils]: 16: Hoare triple {484#false} assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; {484#false} is VALID [2020-07-29 01:33:07,236 INFO L280 TraceCheckUtils]: 17: Hoare triple {484#false} call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); {484#false} is VALID [2020-07-29 01:33:07,236 INFO L280 TraceCheckUtils]: 18: Hoare triple {484#false} assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; {484#false} is VALID [2020-07-29 01:33:07,237 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:33:07,237 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426505173] [2020-07-29 01:33:07,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:33:07,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:33:07,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544368344] [2020-07-29 01:33:07,238 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:33:07,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:07,239 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 3 times [2020-07-29 01:33:07,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:07,239 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513685176] [2020-07-29 01:33:07,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:07,260 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:07,278 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:07,282 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:33:07,418 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-29 01:33:07,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:33:07,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:33:07,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:33:07,503 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. cyclomatic complexity: 15 Second operand 6 states. [2020-07-29 01:33:08,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:08,072 INFO L93 Difference]: Finished difference Result 62 states and 87 transitions. [2020-07-29 01:33:08,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:33:08,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:33:08,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:33:08,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 87 transitions. [2020-07-29 01:33:08,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:08,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 62 states and 87 transitions. [2020-07-29 01:33:08,121 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2020-07-29 01:33:08,122 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2020-07-29 01:33:08,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 87 transitions. [2020-07-29 01:33:08,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:33:08,123 INFO L688 BuchiCegarLoop]: Abstraction has 62 states and 87 transitions. [2020-07-29 01:33:08,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 87 transitions. [2020-07-29 01:33:08,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 36. [2020-07-29 01:33:08,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:33:08,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states and 87 transitions. Second operand 36 states. [2020-07-29 01:33:08,130 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states and 87 transitions. Second operand 36 states. [2020-07-29 01:33:08,130 INFO L87 Difference]: Start difference. First operand 62 states and 87 transitions. Second operand 36 states. [2020-07-29 01:33:08,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:08,134 INFO L93 Difference]: Finished difference Result 62 states and 87 transitions. [2020-07-29 01:33:08,134 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2020-07-29 01:33:08,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:08,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:08,141 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 62 states and 87 transitions. [2020-07-29 01:33:08,141 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 62 states and 87 transitions. [2020-07-29 01:33:08,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:08,148 INFO L93 Difference]: Finished difference Result 62 states and 87 transitions. [2020-07-29 01:33:08,149 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2020-07-29 01:33:08,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:08,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:08,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:33:08,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:33:08,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-29 01:33:08,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2020-07-29 01:33:08,156 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 50 transitions. [2020-07-29 01:33:08,156 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 50 transitions. [2020-07-29 01:33:08,156 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:33:08,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 50 transitions. [2020-07-29 01:33:08,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:08,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:33:08,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:33:08,160 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:33:08,160 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:33:08,162 INFO L794 eck$LassoCheckResult]: Stem: 579#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 575#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 576#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 577#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 559#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 560#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 580#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 581#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 561#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem19;havoc main_#t~post20; 562#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 569#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; 582#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 563#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 564#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 572#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 584#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 565#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 566#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 573#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 574#L598-4 [2020-07-29 01:33:08,162 INFO L796 eck$LassoCheckResult]: Loop: 574#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 570#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 571#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 574#L598-4 [2020-07-29 01:33:08,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:08,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1940384188, now seen corresponding path program 1 times [2020-07-29 01:33:08,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:08,164 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040444844] [2020-07-29 01:33:08,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:33:08,251 INFO L280 TraceCheckUtils]: 0: Hoare triple {722#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {722#true} is VALID [2020-07-29 01:33:08,251 INFO L280 TraceCheckUtils]: 1: Hoare triple {722#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; {722#true} is VALID [2020-07-29 01:33:08,252 INFO L280 TraceCheckUtils]: 2: Hoare triple {722#true} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); {722#true} is VALID [2020-07-29 01:33:08,254 INFO L280 TraceCheckUtils]: 3: Hoare triple {722#true} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); {724#(= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) |ULTIMATE.start_main_#t~mem8|)} is VALID [2020-07-29 01:33:08,257 INFO L280 TraceCheckUtils]: 4: Hoare triple {724#(= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) |ULTIMATE.start_main_#t~mem8|)} assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; {725#(<= 2 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:08,258 INFO L280 TraceCheckUtils]: 5: Hoare triple {725#(<= 2 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); {726#(<= 2 |ULTIMATE.start_main_#t~mem13|)} is VALID [2020-07-29 01:33:08,259 INFO L280 TraceCheckUtils]: 6: Hoare triple {726#(<= 2 |ULTIMATE.start_main_#t~mem13|)} assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; {723#false} is VALID [2020-07-29 01:33:08,259 INFO L280 TraceCheckUtils]: 7: Hoare triple {723#false} call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); {723#false} is VALID [2020-07-29 01:33:08,259 INFO L280 TraceCheckUtils]: 8: Hoare triple {723#false} assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem19;havoc main_#t~post20; {723#false} is VALID [2020-07-29 01:33:08,260 INFO L280 TraceCheckUtils]: 9: Hoare triple {723#false} call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); {723#false} is VALID [2020-07-29 01:33:08,260 INFO L280 TraceCheckUtils]: 10: Hoare triple {723#false} assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; {723#false} is VALID [2020-07-29 01:33:08,260 INFO L280 TraceCheckUtils]: 11: Hoare triple {723#false} call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); {723#false} is VALID [2020-07-29 01:33:08,260 INFO L280 TraceCheckUtils]: 12: Hoare triple {723#false} assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; {723#false} is VALID [2020-07-29 01:33:08,261 INFO L280 TraceCheckUtils]: 13: Hoare triple {723#false} call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); {723#false} is VALID [2020-07-29 01:33:08,261 INFO L280 TraceCheckUtils]: 14: Hoare triple {723#false} assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; {723#false} is VALID [2020-07-29 01:33:08,261 INFO L280 TraceCheckUtils]: 15: Hoare triple {723#false} call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); {723#false} is VALID [2020-07-29 01:33:08,262 INFO L280 TraceCheckUtils]: 16: Hoare triple {723#false} assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; {723#false} is VALID [2020-07-29 01:33:08,262 INFO L280 TraceCheckUtils]: 17: Hoare triple {723#false} call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); {723#false} is VALID [2020-07-29 01:33:08,263 INFO L280 TraceCheckUtils]: 18: Hoare triple {723#false} assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; {723#false} is VALID [2020-07-29 01:33:08,265 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:33:08,265 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040444844] [2020-07-29 01:33:08,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:33:08,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:33:08,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226610880] [2020-07-29 01:33:08,266 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:33:08,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:08,267 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 4 times [2020-07-29 01:33:08,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:08,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096276236] [2020-07-29 01:33:08,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:08,315 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:08,339 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:08,343 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:33:08,482 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-29 01:33:08,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:33:08,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:33:08,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:33:08,544 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. cyclomatic complexity: 15 Second operand 5 states. [2020-07-29 01:33:08,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:08,950 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2020-07-29 01:33:08,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:33:08,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:33:08,989 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:33:08,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 68 transitions. [2020-07-29 01:33:08,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:08,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 68 transitions. [2020-07-29 01:33:08,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2020-07-29 01:33:08,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2020-07-29 01:33:08,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 68 transitions. [2020-07-29 01:33:09,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:33:09,000 INFO L688 BuchiCegarLoop]: Abstraction has 49 states and 68 transitions. [2020-07-29 01:33:09,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 68 transitions. [2020-07-29 01:33:09,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2020-07-29 01:33:09,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:33:09,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states and 68 transitions. Second operand 36 states. [2020-07-29 01:33:09,008 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states and 68 transitions. Second operand 36 states. [2020-07-29 01:33:09,008 INFO L87 Difference]: Start difference. First operand 49 states and 68 transitions. Second operand 36 states. [2020-07-29 01:33:09,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:09,011 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2020-07-29 01:33:09,011 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 68 transitions. [2020-07-29 01:33:09,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:09,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:09,012 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 49 states and 68 transitions. [2020-07-29 01:33:09,012 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 49 states and 68 transitions. [2020-07-29 01:33:09,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:09,014 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2020-07-29 01:33:09,015 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 68 transitions. [2020-07-29 01:33:09,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:09,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:09,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:33:09,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:33:09,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-29 01:33:09,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2020-07-29 01:33:09,017 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 49 transitions. [2020-07-29 01:33:09,018 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 49 transitions. [2020-07-29 01:33:09,018 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:33:09,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 49 transitions. [2020-07-29 01:33:09,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:09,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:33:09,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:33:09,020 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:33:09,020 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:33:09,020 INFO L794 eck$LassoCheckResult]: Stem: 801#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 797#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 798#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 799#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 780#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 781#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 802#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem14;havoc main_#t~post15; 803#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 782#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem19;havoc main_#t~post20; 783#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 792#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; 804#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 784#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 785#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 809#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 806#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 786#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 787#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 795#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 796#L598-4 [2020-07-29 01:33:09,021 INFO L796 eck$LassoCheckResult]: Loop: 796#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 790#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 791#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 796#L598-4 [2020-07-29 01:33:09,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:09,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1353578174, now seen corresponding path program 1 times [2020-07-29 01:33:09,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:09,022 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458269396] [2020-07-29 01:33:09,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:33:09,085 INFO L280 TraceCheckUtils]: 0: Hoare triple {917#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {917#true} is VALID [2020-07-29 01:33:09,085 INFO L280 TraceCheckUtils]: 1: Hoare triple {917#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; {917#true} is VALID [2020-07-29 01:33:09,085 INFO L280 TraceCheckUtils]: 2: Hoare triple {917#true} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); {917#true} is VALID [2020-07-29 01:33:09,086 INFO L280 TraceCheckUtils]: 3: Hoare triple {917#true} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); {917#true} is VALID [2020-07-29 01:33:09,086 INFO L280 TraceCheckUtils]: 4: Hoare triple {917#true} assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; {917#true} is VALID [2020-07-29 01:33:09,087 INFO L280 TraceCheckUtils]: 5: Hoare triple {917#true} call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); {917#true} is VALID [2020-07-29 01:33:09,087 INFO L280 TraceCheckUtils]: 6: Hoare triple {917#true} assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem14;havoc main_#t~post15; {917#true} is VALID [2020-07-29 01:33:09,088 INFO L280 TraceCheckUtils]: 7: Hoare triple {917#true} call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); {919#(= |ULTIMATE.start_main_#t~mem18| (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:09,089 INFO L280 TraceCheckUtils]: 8: Hoare triple {919#(= |ULTIMATE.start_main_#t~mem18| (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem19;havoc main_#t~post20; {920#(<= 2 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:09,090 INFO L280 TraceCheckUtils]: 9: Hoare triple {920#(<= 2 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); {921#(<= 2 |ULTIMATE.start_main_#t~mem23|)} is VALID [2020-07-29 01:33:09,092 INFO L280 TraceCheckUtils]: 10: Hoare triple {921#(<= 2 |ULTIMATE.start_main_#t~mem23|)} assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; {918#false} is VALID [2020-07-29 01:33:09,092 INFO L280 TraceCheckUtils]: 11: Hoare triple {918#false} call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); {918#false} is VALID [2020-07-29 01:33:09,092 INFO L280 TraceCheckUtils]: 12: Hoare triple {918#false} assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; {918#false} is VALID [2020-07-29 01:33:09,093 INFO L280 TraceCheckUtils]: 13: Hoare triple {918#false} call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); {918#false} is VALID [2020-07-29 01:33:09,093 INFO L280 TraceCheckUtils]: 14: Hoare triple {918#false} assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; {918#false} is VALID [2020-07-29 01:33:09,094 INFO L280 TraceCheckUtils]: 15: Hoare triple {918#false} call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); {918#false} is VALID [2020-07-29 01:33:09,094 INFO L280 TraceCheckUtils]: 16: Hoare triple {918#false} assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; {918#false} is VALID [2020-07-29 01:33:09,094 INFO L280 TraceCheckUtils]: 17: Hoare triple {918#false} call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); {918#false} is VALID [2020-07-29 01:33:09,094 INFO L280 TraceCheckUtils]: 18: Hoare triple {918#false} assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; {918#false} is VALID [2020-07-29 01:33:09,095 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:33:09,095 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458269396] [2020-07-29 01:33:09,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:33:09,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:33:09,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796505396] [2020-07-29 01:33:09,096 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:33:09,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:09,097 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 5 times [2020-07-29 01:33:09,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:09,097 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53894921] [2020-07-29 01:33:09,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:09,114 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:09,128 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:09,134 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:33:09,268 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-29 01:33:09,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:33:09,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:33:09,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:33:09,339 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. cyclomatic complexity: 14 Second operand 5 states. [2020-07-29 01:33:09,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:09,711 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2020-07-29 01:33:09,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:33:09,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:33:09,745 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:33:09,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 67 transitions. [2020-07-29 01:33:09,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:09,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 67 transitions. [2020-07-29 01:33:09,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2020-07-29 01:33:09,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2020-07-29 01:33:09,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 67 transitions. [2020-07-29 01:33:09,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:33:09,752 INFO L688 BuchiCegarLoop]: Abstraction has 49 states and 67 transitions. [2020-07-29 01:33:09,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 67 transitions. [2020-07-29 01:33:09,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 38. [2020-07-29 01:33:09,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:33:09,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states and 67 transitions. Second operand 38 states. [2020-07-29 01:33:09,756 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states and 67 transitions. Second operand 38 states. [2020-07-29 01:33:09,756 INFO L87 Difference]: Start difference. First operand 49 states and 67 transitions. Second operand 38 states. [2020-07-29 01:33:09,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:09,758 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2020-07-29 01:33:09,759 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2020-07-29 01:33:09,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:09,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:09,759 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 49 states and 67 transitions. [2020-07-29 01:33:09,759 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 49 states and 67 transitions. [2020-07-29 01:33:09,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:09,761 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2020-07-29 01:33:09,762 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2020-07-29 01:33:09,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:09,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:09,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:33:09,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:33:09,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-29 01:33:09,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2020-07-29 01:33:09,764 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 51 transitions. [2020-07-29 01:33:09,764 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 51 transitions. [2020-07-29 01:33:09,764 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:33:09,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 51 transitions. [2020-07-29 01:33:09,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:09,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:33:09,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:33:09,766 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:33:09,766 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:33:09,766 INFO L794 eck$LassoCheckResult]: Stem: 996#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 991#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 992#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 994#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 975#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 976#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 981#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem14;havoc main_#t~post15; 997#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 977#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem19;havoc main_#t~post20; 978#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 998#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; 999#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 979#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 980#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1005#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 1001#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 982#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 983#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 990#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 993#L598-4 [2020-07-29 01:33:09,767 INFO L796 eck$LassoCheckResult]: Loop: 993#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 986#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 987#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 993#L598-4 [2020-07-29 01:33:09,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:09,767 INFO L82 PathProgramCache]: Analyzing trace with hash -2033636544, now seen corresponding path program 1 times [2020-07-29 01:33:09,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:09,768 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461437734] [2020-07-29 01:33:09,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:33:09,860 INFO L280 TraceCheckUtils]: 0: Hoare triple {1114#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1114#true} is VALID [2020-07-29 01:33:09,860 INFO L280 TraceCheckUtils]: 1: Hoare triple {1114#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; {1114#true} is VALID [2020-07-29 01:33:09,861 INFO L280 TraceCheckUtils]: 2: Hoare triple {1114#true} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); {1114#true} is VALID [2020-07-29 01:33:09,861 INFO L280 TraceCheckUtils]: 3: Hoare triple {1114#true} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1114#true} is VALID [2020-07-29 01:33:09,861 INFO L280 TraceCheckUtils]: 4: Hoare triple {1114#true} assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; {1114#true} is VALID [2020-07-29 01:33:09,862 INFO L280 TraceCheckUtils]: 5: Hoare triple {1114#true} call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1114#true} is VALID [2020-07-29 01:33:09,862 INFO L280 TraceCheckUtils]: 6: Hoare triple {1114#true} assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem14;havoc main_#t~post15; {1114#true} is VALID [2020-07-29 01:33:09,862 INFO L280 TraceCheckUtils]: 7: Hoare triple {1114#true} call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1116#(= |ULTIMATE.start_main_#t~mem18| (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:09,864 INFO L280 TraceCheckUtils]: 8: Hoare triple {1116#(= |ULTIMATE.start_main_#t~mem18| (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem19;havoc main_#t~post20; {1117#(<= 2 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:09,866 INFO L280 TraceCheckUtils]: 9: Hoare triple {1117#(<= 2 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1117#(<= 2 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:09,868 INFO L280 TraceCheckUtils]: 10: Hoare triple {1117#(<= 2 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; {1118#(<= 3 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:09,869 INFO L280 TraceCheckUtils]: 11: Hoare triple {1118#(<= 3 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1119#(<= 3 |ULTIMATE.start_main_#t~mem28|)} is VALID [2020-07-29 01:33:09,871 INFO L280 TraceCheckUtils]: 12: Hoare triple {1119#(<= 3 |ULTIMATE.start_main_#t~mem28|)} assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; {1115#false} is VALID [2020-07-29 01:33:09,872 INFO L280 TraceCheckUtils]: 13: Hoare triple {1115#false} call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1115#false} is VALID [2020-07-29 01:33:09,872 INFO L280 TraceCheckUtils]: 14: Hoare triple {1115#false} assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; {1115#false} is VALID [2020-07-29 01:33:09,872 INFO L280 TraceCheckUtils]: 15: Hoare triple {1115#false} call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1115#false} is VALID [2020-07-29 01:33:09,872 INFO L280 TraceCheckUtils]: 16: Hoare triple {1115#false} assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; {1115#false} is VALID [2020-07-29 01:33:09,873 INFO L280 TraceCheckUtils]: 17: Hoare triple {1115#false} call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1115#false} is VALID [2020-07-29 01:33:09,873 INFO L280 TraceCheckUtils]: 18: Hoare triple {1115#false} assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; {1115#false} is VALID [2020-07-29 01:33:09,874 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:33:09,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461437734] [2020-07-29 01:33:09,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:33:09,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:33:09,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533978466] [2020-07-29 01:33:09,876 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:33:09,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:09,876 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 6 times [2020-07-29 01:33:09,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:09,877 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964429203] [2020-07-29 01:33:09,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:09,891 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:09,904 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:09,909 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:33:10,065 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-29 01:33:10,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:33:10,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:33:10,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:33:10,175 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. cyclomatic complexity: 14 Second operand 6 states. [2020-07-29 01:33:10,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:10,571 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2020-07-29 01:33:10,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:33:10,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:33:10,614 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:33:10,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 76 transitions. [2020-07-29 01:33:10,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:10,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 56 states and 76 transitions. [2020-07-29 01:33:10,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2020-07-29 01:33:10,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2020-07-29 01:33:10,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 76 transitions. [2020-07-29 01:33:10,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:33:10,620 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 76 transitions. [2020-07-29 01:33:10,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 76 transitions. [2020-07-29 01:33:10,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2020-07-29 01:33:10,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:33:10,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states and 76 transitions. Second operand 40 states. [2020-07-29 01:33:10,624 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states and 76 transitions. Second operand 40 states. [2020-07-29 01:33:10,624 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand 40 states. [2020-07-29 01:33:10,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:10,626 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2020-07-29 01:33:10,626 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2020-07-29 01:33:10,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:10,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:10,627 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 56 states and 76 transitions. [2020-07-29 01:33:10,627 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 56 states and 76 transitions. [2020-07-29 01:33:10,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:10,629 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2020-07-29 01:33:10,629 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2020-07-29 01:33:10,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:10,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:10,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:33:10,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:33:10,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-29 01:33:10,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2020-07-29 01:33:10,631 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2020-07-29 01:33:10,631 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2020-07-29 01:33:10,631 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:33:10,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 53 transitions. [2020-07-29 01:33:10,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:10,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:33:10,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:33:10,633 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:33:10,633 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:33:10,633 INFO L794 eck$LassoCheckResult]: Stem: 1201#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1197#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1198#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 1199#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1180#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 1181#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1202#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem14;havoc main_#t~post15; 1203#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1182#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem19;havoc main_#t~post20; 1183#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1204#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; 1205#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1184#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem29;havoc main_#t~post30; 1185#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1194#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 1207#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1186#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 1187#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1195#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 1196#L598-4 [2020-07-29 01:33:10,633 INFO L796 eck$LassoCheckResult]: Loop: 1196#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1190#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1191#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1196#L598-4 [2020-07-29 01:33:10,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:10,634 INFO L82 PathProgramCache]: Analyzing trace with hash 486323390, now seen corresponding path program 1 times [2020-07-29 01:33:10,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:10,634 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047547568] [2020-07-29 01:33:10,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:33:10,783 INFO L280 TraceCheckUtils]: 0: Hoare triple {1335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1335#true} is VALID [2020-07-29 01:33:10,784 INFO L280 TraceCheckUtils]: 1: Hoare triple {1335#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; {1335#true} is VALID [2020-07-29 01:33:10,784 INFO L280 TraceCheckUtils]: 2: Hoare triple {1335#true} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); {1335#true} is VALID [2020-07-29 01:33:10,786 INFO L280 TraceCheckUtils]: 3: Hoare triple {1335#true} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1337#(= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) |ULTIMATE.start_main_#t~mem8|)} is VALID [2020-07-29 01:33:10,786 INFO L280 TraceCheckUtils]: 4: Hoare triple {1337#(= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) |ULTIMATE.start_main_#t~mem8|)} assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; {1338#(<= 2 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:10,787 INFO L280 TraceCheckUtils]: 5: Hoare triple {1338#(<= 2 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1338#(<= 2 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:10,790 INFO L280 TraceCheckUtils]: 6: Hoare triple {1338#(<= 2 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem14;havoc main_#t~post15; {1339#(<= 3 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:10,798 INFO L280 TraceCheckUtils]: 7: Hoare triple {1339#(<= 3 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1339#(<= 3 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:10,800 INFO L280 TraceCheckUtils]: 8: Hoare triple {1339#(<= 3 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem19;havoc main_#t~post20; {1340#(<= 4 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:10,800 INFO L280 TraceCheckUtils]: 9: Hoare triple {1340#(<= 4 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1340#(<= 4 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:10,801 INFO L280 TraceCheckUtils]: 10: Hoare triple {1340#(<= 4 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; {1341#(<= 5 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:10,802 INFO L280 TraceCheckUtils]: 11: Hoare triple {1341#(<= 5 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1341#(<= 5 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:10,803 INFO L280 TraceCheckUtils]: 12: Hoare triple {1341#(<= 5 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem29;havoc main_#t~post30; {1342#(<= 6 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:10,803 INFO L280 TraceCheckUtils]: 13: Hoare triple {1342#(<= 6 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1342#(<= 6 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:10,807 INFO L280 TraceCheckUtils]: 14: Hoare triple {1342#(<= 6 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; {1343#(<= 7 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:10,808 INFO L280 TraceCheckUtils]: 15: Hoare triple {1343#(<= 7 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1344#(<= 7 |ULTIMATE.start_main_#t~mem38|)} is VALID [2020-07-29 01:33:10,809 INFO L280 TraceCheckUtils]: 16: Hoare triple {1344#(<= 7 |ULTIMATE.start_main_#t~mem38|)} assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; {1336#false} is VALID [2020-07-29 01:33:10,809 INFO L280 TraceCheckUtils]: 17: Hoare triple {1336#false} call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1336#false} is VALID [2020-07-29 01:33:10,809 INFO L280 TraceCheckUtils]: 18: Hoare triple {1336#false} assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; {1336#false} is VALID [2020-07-29 01:33:10,810 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:33:10,810 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047547568] [2020-07-29 01:33:10,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:33:10,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-29 01:33:10,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969883390] [2020-07-29 01:33:10,811 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:33:10,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:10,812 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 7 times [2020-07-29 01:33:10,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:10,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862654271] [2020-07-29 01:33:10,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:10,825 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:10,837 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:10,840 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:33:11,000 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-29 01:33:11,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:33:11,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:33:11,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:33:11,058 INFO L87 Difference]: Start difference. First operand 40 states and 53 transitions. cyclomatic complexity: 14 Second operand 10 states. [2020-07-29 01:33:11,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:11,670 INFO L93 Difference]: Finished difference Result 68 states and 90 transitions. [2020-07-29 01:33:11,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:33:11,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:33:11,701 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:33:11,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 90 transitions. [2020-07-29 01:33:11,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:11,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 90 transitions. [2020-07-29 01:33:11,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2020-07-29 01:33:11,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2020-07-29 01:33:11,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 90 transitions. [2020-07-29 01:33:11,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:33:11,709 INFO L688 BuchiCegarLoop]: Abstraction has 68 states and 90 transitions. [2020-07-29 01:33:11,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 90 transitions. [2020-07-29 01:33:11,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2020-07-29 01:33:11,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:33:11,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states and 90 transitions. Second operand 48 states. [2020-07-29 01:33:11,713 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states and 90 transitions. Second operand 48 states. [2020-07-29 01:33:11,713 INFO L87 Difference]: Start difference. First operand 68 states and 90 transitions. Second operand 48 states. [2020-07-29 01:33:11,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:11,715 INFO L93 Difference]: Finished difference Result 68 states and 90 transitions. [2020-07-29 01:33:11,715 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 90 transitions. [2020-07-29 01:33:11,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:11,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:11,716 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 68 states and 90 transitions. [2020-07-29 01:33:11,716 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 68 states and 90 transitions. [2020-07-29 01:33:11,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:11,718 INFO L93 Difference]: Finished difference Result 68 states and 90 transitions. [2020-07-29 01:33:11,718 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 90 transitions. [2020-07-29 01:33:11,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:11,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:11,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:33:11,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:33:11,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-29 01:33:11,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2020-07-29 01:33:11,720 INFO L711 BuchiCegarLoop]: Abstraction has 48 states and 62 transitions. [2020-07-29 01:33:11,721 INFO L591 BuchiCegarLoop]: Abstraction has 48 states and 62 transitions. [2020-07-29 01:33:11,721 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:33:11,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 62 transitions. [2020-07-29 01:33:11,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:11,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:33:11,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:33:11,722 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:33:11,722 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:33:11,723 INFO L794 eck$LassoCheckResult]: Stem: 1437#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1433#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1434#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 1435#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1417#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 1418#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1423#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem14;havoc main_#t~post15; 1458#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1419#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem19;havoc main_#t~post20; 1420#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1428#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; 1441#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1421#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem29;havoc main_#t~post30; 1422#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1460#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; 1443#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1445#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 1425#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1431#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 1432#L598-4 [2020-07-29 01:33:11,723 INFO L796 eck$LassoCheckResult]: Loop: 1432#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1426#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1427#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1432#L598-4 [2020-07-29 01:33:11,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:11,723 INFO L82 PathProgramCache]: Analyzing trace with hash 488170432, now seen corresponding path program 1 times [2020-07-29 01:33:11,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:11,724 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123232477] [2020-07-29 01:33:11,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:33:11,857 INFO L280 TraceCheckUtils]: 0: Hoare triple {1604#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1604#true} is VALID [2020-07-29 01:33:11,857 INFO L280 TraceCheckUtils]: 1: Hoare triple {1604#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; {1604#true} is VALID [2020-07-29 01:33:11,858 INFO L280 TraceCheckUtils]: 2: Hoare triple {1604#true} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); {1604#true} is VALID [2020-07-29 01:33:11,859 INFO L280 TraceCheckUtils]: 3: Hoare triple {1604#true} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1606#(= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) |ULTIMATE.start_main_#t~mem8|)} is VALID [2020-07-29 01:33:11,860 INFO L280 TraceCheckUtils]: 4: Hoare triple {1606#(= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) |ULTIMATE.start_main_#t~mem8|)} assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; {1607#(<= 2 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:11,860 INFO L280 TraceCheckUtils]: 5: Hoare triple {1607#(<= 2 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1607#(<= 2 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:11,861 INFO L280 TraceCheckUtils]: 6: Hoare triple {1607#(<= 2 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem14;havoc main_#t~post15; {1608#(<= 3 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:11,861 INFO L280 TraceCheckUtils]: 7: Hoare triple {1608#(<= 3 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1608#(<= 3 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:11,862 INFO L280 TraceCheckUtils]: 8: Hoare triple {1608#(<= 3 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem19;havoc main_#t~post20; {1609#(<= 4 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:11,863 INFO L280 TraceCheckUtils]: 9: Hoare triple {1609#(<= 4 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1609#(<= 4 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:11,864 INFO L280 TraceCheckUtils]: 10: Hoare triple {1609#(<= 4 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; {1610#(<= 5 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:11,864 INFO L280 TraceCheckUtils]: 11: Hoare triple {1610#(<= 5 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1610#(<= 5 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:11,865 INFO L280 TraceCheckUtils]: 12: Hoare triple {1610#(<= 5 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem29;havoc main_#t~post30; {1611#(<= 6 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:11,866 INFO L280 TraceCheckUtils]: 13: Hoare triple {1611#(<= 6 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1612#(<= 6 |ULTIMATE.start_main_#t~mem33|)} is VALID [2020-07-29 01:33:11,866 INFO L280 TraceCheckUtils]: 14: Hoare triple {1612#(<= 6 |ULTIMATE.start_main_#t~mem33|)} assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; {1605#false} is VALID [2020-07-29 01:33:11,867 INFO L280 TraceCheckUtils]: 15: Hoare triple {1605#false} call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1605#false} is VALID [2020-07-29 01:33:11,867 INFO L280 TraceCheckUtils]: 16: Hoare triple {1605#false} assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; {1605#false} is VALID [2020-07-29 01:33:11,867 INFO L280 TraceCheckUtils]: 17: Hoare triple {1605#false} call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1605#false} is VALID [2020-07-29 01:33:11,867 INFO L280 TraceCheckUtils]: 18: Hoare triple {1605#false} assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; {1605#false} is VALID [2020-07-29 01:33:11,868 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:33:11,868 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123232477] [2020-07-29 01:33:11,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:33:11,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-29 01:33:11,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723320892] [2020-07-29 01:33:11,869 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:33:11,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:11,870 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 8 times [2020-07-29 01:33:11,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:11,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048160814] [2020-07-29 01:33:11,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:11,882 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:11,893 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:11,895 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:33:12,049 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-29 01:33:12,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:33:12,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:33:12,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:33:12,108 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. cyclomatic complexity: 15 Second operand 9 states. [2020-07-29 01:33:12,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:12,571 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2020-07-29 01:33:12,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:33:12,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:33:12,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:33:12,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 72 transitions. [2020-07-29 01:33:12,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:12,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 56 states and 72 transitions. [2020-07-29 01:33:12,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2020-07-29 01:33:12,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2020-07-29 01:33:12,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 72 transitions. [2020-07-29 01:33:12,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:33:12,610 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 72 transitions. [2020-07-29 01:33:12,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 72 transitions. [2020-07-29 01:33:12,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2020-07-29 01:33:12,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:33:12,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states and 72 transitions. Second operand 48 states. [2020-07-29 01:33:12,622 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states and 72 transitions. Second operand 48 states. [2020-07-29 01:33:12,622 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand 48 states. [2020-07-29 01:33:12,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:12,624 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2020-07-29 01:33:12,625 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2020-07-29 01:33:12,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:12,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:12,625 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 56 states and 72 transitions. [2020-07-29 01:33:12,625 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 56 states and 72 transitions. [2020-07-29 01:33:12,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:12,627 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2020-07-29 01:33:12,627 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2020-07-29 01:33:12,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:12,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:12,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:33:12,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:33:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-29 01:33:12,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2020-07-29 01:33:12,631 INFO L711 BuchiCegarLoop]: Abstraction has 48 states and 61 transitions. [2020-07-29 01:33:12,631 INFO L591 BuchiCegarLoop]: Abstraction has 48 states and 61 transitions. [2020-07-29 01:33:12,631 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 01:33:12,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 61 transitions. [2020-07-29 01:33:12,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:12,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:33:12,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:33:12,633 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:33:12,633 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:33:12,634 INFO L794 eck$LassoCheckResult]: Stem: 1692#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1688#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1689#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 1690#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1673#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 1674#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1679#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem14;havoc main_#t~post15; 1693#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1675#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem19;havoc main_#t~post20; 1676#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1684#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; 1720#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1677#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem29;havoc main_#t~post30; 1678#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1685#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 1697#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1680#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 1681#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1686#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 1687#L598-4 [2020-07-29 01:33:12,634 INFO L796 eck$LassoCheckResult]: Loop: 1687#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1682#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1683#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1687#L598-4 [2020-07-29 01:33:12,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:12,635 INFO L82 PathProgramCache]: Analyzing trace with hash 486321468, now seen corresponding path program 1 times [2020-07-29 01:33:12,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:12,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157105533] [2020-07-29 01:33:12,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:33:12,728 INFO L280 TraceCheckUtils]: 0: Hoare triple {1836#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1836#true} is VALID [2020-07-29 01:33:12,729 INFO L280 TraceCheckUtils]: 1: Hoare triple {1836#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; {1836#true} is VALID [2020-07-29 01:33:12,729 INFO L280 TraceCheckUtils]: 2: Hoare triple {1836#true} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); {1836#true} is VALID [2020-07-29 01:33:12,730 INFO L280 TraceCheckUtils]: 3: Hoare triple {1836#true} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1836#true} is VALID [2020-07-29 01:33:12,730 INFO L280 TraceCheckUtils]: 4: Hoare triple {1836#true} assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; {1836#true} is VALID [2020-07-29 01:33:12,730 INFO L280 TraceCheckUtils]: 5: Hoare triple {1836#true} call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1836#true} is VALID [2020-07-29 01:33:12,730 INFO L280 TraceCheckUtils]: 6: Hoare triple {1836#true} assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem14;havoc main_#t~post15; {1836#true} is VALID [2020-07-29 01:33:12,731 INFO L280 TraceCheckUtils]: 7: Hoare triple {1836#true} call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1836#true} is VALID [2020-07-29 01:33:12,731 INFO L280 TraceCheckUtils]: 8: Hoare triple {1836#true} assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem19;havoc main_#t~post20; {1836#true} is VALID [2020-07-29 01:33:12,731 INFO L280 TraceCheckUtils]: 9: Hoare triple {1836#true} call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1836#true} is VALID [2020-07-29 01:33:12,731 INFO L280 TraceCheckUtils]: 10: Hoare triple {1836#true} assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; {1836#true} is VALID [2020-07-29 01:33:12,731 INFO L280 TraceCheckUtils]: 11: Hoare triple {1836#true} call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1836#true} is VALID [2020-07-29 01:33:12,731 INFO L280 TraceCheckUtils]: 12: Hoare triple {1836#true} assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem29;havoc main_#t~post30; {1836#true} is VALID [2020-07-29 01:33:12,732 INFO L280 TraceCheckUtils]: 13: Hoare triple {1836#true} call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1836#true} is VALID [2020-07-29 01:33:12,732 INFO L280 TraceCheckUtils]: 14: Hoare triple {1836#true} assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; {1836#true} is VALID [2020-07-29 01:33:12,732 INFO L280 TraceCheckUtils]: 15: Hoare triple {1836#true} call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1838#(= |ULTIMATE.start_main_#t~mem38| (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:12,733 INFO L280 TraceCheckUtils]: 16: Hoare triple {1838#(= |ULTIMATE.start_main_#t~mem38| (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; {1839#(<= 2 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:12,734 INFO L280 TraceCheckUtils]: 17: Hoare triple {1839#(<= 2 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); {1840#(<= 2 |ULTIMATE.start_main_#t~mem43|)} is VALID [2020-07-29 01:33:12,735 INFO L280 TraceCheckUtils]: 18: Hoare triple {1840#(<= 2 |ULTIMATE.start_main_#t~mem43|)} assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; {1837#false} is VALID [2020-07-29 01:33:12,735 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:33:12,735 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157105533] [2020-07-29 01:33:12,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:33:12,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:33:12,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394437575] [2020-07-29 01:33:12,736 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:33:12,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:12,737 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 9 times [2020-07-29 01:33:12,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:12,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119349041] [2020-07-29 01:33:12,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:12,748 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:12,758 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:12,760 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:33:12,886 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-29 01:33:12,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:33:12,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:33:12,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:33:12,943 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. cyclomatic complexity: 14 Second operand 5 states. [2020-07-29 01:33:13,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:13,203 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2020-07-29 01:33:13,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:33:13,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:33:13,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:33:13,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 67 transitions. [2020-07-29 01:33:13,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:13,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 67 transitions. [2020-07-29 01:33:13,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2020-07-29 01:33:13,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2020-07-29 01:33:13,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 67 transitions. [2020-07-29 01:33:13,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:33:13,239 INFO L688 BuchiCegarLoop]: Abstraction has 53 states and 67 transitions. [2020-07-29 01:33:13,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 67 transitions. [2020-07-29 01:33:13,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2020-07-29 01:33:13,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:33:13,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states and 67 transitions. Second operand 50 states. [2020-07-29 01:33:13,242 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states and 67 transitions. Second operand 50 states. [2020-07-29 01:33:13,242 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand 50 states. [2020-07-29 01:33:13,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:13,244 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2020-07-29 01:33:13,244 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2020-07-29 01:33:13,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:13,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:13,244 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 53 states and 67 transitions. [2020-07-29 01:33:13,244 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 53 states and 67 transitions. [2020-07-29 01:33:13,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:13,246 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2020-07-29 01:33:13,246 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2020-07-29 01:33:13,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:13,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:13,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:33:13,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:33:13,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-29 01:33:13,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2020-07-29 01:33:13,247 INFO L711 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2020-07-29 01:33:13,248 INFO L591 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2020-07-29 01:33:13,248 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-29 01:33:13,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 63 transitions. [2020-07-29 01:33:13,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:13,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:33:13,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:33:13,249 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:33:13,249 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:33:13,249 INFO L794 eck$LassoCheckResult]: Stem: 1920#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1915#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1916#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 1918#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1898#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 1899#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1905#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem14;havoc main_#t~post15; 1921#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1941#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem19;havoc main_#t~post20; 1939#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1936#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; 1935#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1932#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem29;havoc main_#t~post30; 1931#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1924#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 1925#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1906#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 1907#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1927#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post45;havoc main_#t~mem44; 1917#L598-4 [2020-07-29 01:33:13,250 INFO L796 eck$LassoCheckResult]: Loop: 1917#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1909#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1910#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1917#L598-4 [2020-07-29 01:33:13,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:13,250 INFO L82 PathProgramCache]: Analyzing trace with hash 486321466, now seen corresponding path program 1 times [2020-07-29 01:33:13,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:13,250 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805879776] [2020-07-29 01:33:13,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:13,269 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:13,286 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:13,296 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:33:13,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:13,297 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 10 times [2020-07-29 01:33:13,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:13,297 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777823686] [2020-07-29 01:33:13,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:13,308 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:13,317 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:13,320 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:33:13,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:13,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1078171826, now seen corresponding path program 1 times [2020-07-29 01:33:13,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:13,321 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094740182] [2020-07-29 01:33:13,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:13,350 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:13,374 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:13,384 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:33:13,534 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-29 01:33:17,556 WARN L193 SmtUtils]: Spent 3.93 s on a formula simplification. DAG size of input: 184 DAG size of output: 160 [2020-07-29 01:33:17,809 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-07-29 01:33:17,828 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:33:17,829 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:33:17,829 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:33:17,830 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:33:17,830 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:33:17,830 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:33:17,830 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:33:17,831 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:33:17,831 INFO L133 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca.i_Iteration10_Lasso [2020-07-29 01:33:17,831 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:33:17,831 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:33:17,891 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:33:17,897 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:33:17,900 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:33:17,905 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:33:17,908 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:33:17,912 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:33:17,916 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:33:17,920 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:33:17,925 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:33:17,929 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:33:17,933 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:33:17,939 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:33:17,944 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:33:17,947 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:33:17,956 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:33:17,960 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:33:17,963 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:33:17,967 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:33:17,972 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:33:17,977 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:33:17,990 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:33:17,995 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:33:17,998 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:33:18,002 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:33:18,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:33:18,015 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:33:18,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:33:18,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:33:18,027 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:33:18,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:33:18,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:33:18,039 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:33:18,043 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:33:18,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:33:18,051 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:33:18,057 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:33:18,060 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:33:18,065 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:33:18,070 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:33:18,074 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:33:18,078 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:33:18,082 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:33:18,087 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:33:18,090 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:33:18,099 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:33:18,103 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:33:18,107 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:33:18,110 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:33:18,113 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:33:18,116 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:33:18,120 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:33:18,123 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:33:18,127 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:33:18,131 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:33:18,135 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:33:18,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:33:18,145 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:33:18,692 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2020-07-29 01:33:18,867 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2020-07-29 01:33:20,534 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:33:20,540 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:33:20,551 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:33:20,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:20,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:20,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:20,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:20,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:20,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:20,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:20,560 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:33:20,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:33:20,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:20,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:20,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:20,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:20,607 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:33:20,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:20,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:20,616 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:33:20,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:33:20,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:20,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:20,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:20,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:20,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:20,644 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:20,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:20,647 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:33:20,672 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:33:20,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:20,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:20,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:20,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:20,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:20,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:20,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:20,677 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:33:20,703 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:33:20,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:20,705 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:20,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:20,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:20,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:20,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:20,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:20,707 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) [2020-07-29 01:33:20,733 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:33:20,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:20,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:20,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:20,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:20,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:20,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:20,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:20,738 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:33:20,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:33:20,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:20,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:20,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:20,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:20,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:20,766 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:20,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:20,768 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:33:20,793 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:33:20,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:20,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:20,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:20,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:20,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:20,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:20,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:20,803 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:33:20,830 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:33:20,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:20,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:20,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:20,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:20,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:20,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:20,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:20,837 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:33:20,863 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:33:20,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:20,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:20,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:20,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:20,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:20,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:20,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:20,868 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) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:33:20,892 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:33:20,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:20,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:20,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:20,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:20,896 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:33:20,897 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:33:20,905 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 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:33:20,939 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:33:20,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:20,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:20,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:20,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:20,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:20,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:20,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:20,942 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:33:20,974 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:33:20,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:20,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:20,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:20,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:33:20,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:20,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:20,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:20,979 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:33:21,003 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:33:21,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,008 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:33:21,033 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:33:21,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,038 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:33:21,061 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:33:21,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,066 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:33:21,090 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:33:21,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,092 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,092 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,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 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:33:21,117 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:33:21,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,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 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:33:21,148 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:33:21,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,153 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:33:21,177 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:33:21,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,182 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:33:21,182 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:33:21,186 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:33:21,211 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:33:21,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,216 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:33:21,216 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:33:21,220 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:33:21,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:33:21,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,248 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:33:21,270 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:33:21,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,274 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:33:21,298 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:33:21,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,302 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:33:21,328 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:33:21,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,331 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,331 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,332 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:33:21,356 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:33:21,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,360 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:33:21,384 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:33:21,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,387 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:33:21,414 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:33:21,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,417 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:33:21,441 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:33:21,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,447 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:33:21,469 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:33:21,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,473 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:33:21,496 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:33:21,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,498 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,500 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) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:33:21,528 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:33:21,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,532 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:33:21,555 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:33:21,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,559 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:33:21,583 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:33:21,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,587 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:33:21,587 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:33:21,591 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:33:21,614 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:33:21,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,617 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:33:21,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:33:21,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,644 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:33:21,693 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:33:21,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,698 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:33:21,698 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:33:21,701 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:33:21,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:33:21,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,729 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) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:33:21,753 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:33:21,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,756 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,758 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:33:21,786 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:33:21,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,790 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:33:21,812 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:33:21,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,815 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:33:21,837 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:33:21,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,839 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,841 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:33:21,863 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:33:21,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,866 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:33:21,891 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:33:21,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,893 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,898 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:33:21,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:33:21,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,923 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:33:21,947 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:33:21,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,949 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,949 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,950 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:33:21,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:33:21,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:21,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:21,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:21,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:21,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:21,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:21,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:21,978 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) [2020-07-29 01:33:22,002 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:33:22,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:22,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:22,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:22,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:22,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:22,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:22,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:22,006 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:33:22,029 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:33:22,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:22,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:22,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:22,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:22,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:22,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:22,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:22,034 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:33:22,067 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:33:22,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:22,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:22,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:22,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:22,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:22,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:22,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:22,071 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:33:22,095 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:33:22,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:22,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:22,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:22,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:22,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:22,097 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:22,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:22,099 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:33:22,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:33:22,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:22,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:22,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:22,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:22,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:22,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:22,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:22,125 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:33:22,149 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:33:22,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:22,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:22,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:22,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:22,152 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:33:22,152 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:33:22,155 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:33:22,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:33:22,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:22,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:22,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:22,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:22,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:22,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:22,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:22,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 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:33:22,206 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:33:22,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:22,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:33:22,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:22,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:22,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:22,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:33:22,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:33:22,210 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:33:22,234 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:33:22,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:22,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:22,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:22,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:22,237 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:33:22,238 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:33:22,243 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:33:22,265 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:33:22,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:22,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:22,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:22,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:22,279 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:33:22,279 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:33:22,285 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:33:22,315 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:33:22,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:22,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:22,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:22,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:22,318 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:33:22,318 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:33:22,323 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) [2020-07-29 01:33:22,359 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:33:22,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:22,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:22,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:22,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:22,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:33:22,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:33:22,369 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) [2020-07-29 01:33:22,407 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:33:22,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:33:22,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:33:22,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:33:22,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:33:22,414 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:33:22,414 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:33:22,425 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:33:22,447 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-07-29 01:33:22,447 INFO L444 ModelExtractionUtils]: 5 out of 13 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 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:33:22,462 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:33:22,503 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:33:22,503 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:33:22,505 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(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_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 + 100 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 - 2 >= 0] [2020-07-29 01:33:22,803 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2020-07-29 01:33:22,821 INFO L393 LassoCheck]: Loop: "call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100;" "assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100;" "assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54;" [2020-07-29 01:33:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:33:22,838 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:33:22,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:33:22,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 19 conjunts are in the unsatisfiable core [2020-07-29 01:33:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:33:22,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:33:23,011 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:33:23,017 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:33:23,028 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:33:23,029 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:33:23,029 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:13 [2020-07-29 01:33:23,154 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 0 case distinctions, treesize of input 25 treesize of output 13 [2020-07-29 01:33:23,158 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:33:23,168 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:33:23,169 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:33:23,169 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2020-07-29 01:33:25,754 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:33:25,755 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_109|]. (let ((.cse0 (select |v_#memory_int_109| ULTIMATE.start_main_~x~0.base))) (let ((.cse1 (select .cse0 ULTIMATE.start_main_~x~0.offset))) (and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (= |#memory_int| (store |v_#memory_int_109| ULTIMATE.start_main_~x~0.base (store .cse0 ULTIMATE.start_main_~x~0.offset (+ .cse1 1)))) (<= 1 .cse1) unseeded))) [2020-07-29 01:33:25,755 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (<= 2 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) unseeded) [2020-07-29 01:33:25,799 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 0 case distinctions, treesize of input 25 treesize of output 13 [2020-07-29 01:33:25,803 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:33:25,813 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:33:25,814 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:33:25,814 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2020-07-29 01:33:28,553 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:33:28,553 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_110|]. (let ((.cse1 (select |v_#memory_int_110| ULTIMATE.start_main_~x~0.base))) (let ((.cse0 (select .cse1 ULTIMATE.start_main_~x~0.offset))) (and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (<= 2 .cse0) (= (store |v_#memory_int_110| ULTIMATE.start_main_~x~0.base (store .cse1 ULTIMATE.start_main_~x~0.offset (+ .cse0 1))) |#memory_int|) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded))) [2020-07-29 01:33:28,553 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (<= 3 (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_~x~0.base)) unseeded) [2020-07-29 01:33:28,619 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 0 case distinctions, treesize of input 25 treesize of output 13 [2020-07-29 01:33:28,625 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:33:28,634 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:33:28,635 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:33:28,635 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2020-07-29 01:33:31,320 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:33:31,320 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_111|]. (let ((.cse1 (select |v_#memory_int_111| ULTIMATE.start_main_~x~0.base))) (let ((.cse0 (select .cse1 ULTIMATE.start_main_~x~0.offset))) (and (<= 3 .cse0) (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (= |#memory_int| (store |v_#memory_int_111| ULTIMATE.start_main_~x~0.base (store .cse1 ULTIMATE.start_main_~x~0.offset (+ .cse0 1)))) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded))) [2020-07-29 01:33:31,320 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= 4 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) unseeded) [2020-07-29 01:33:31,375 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 0 case distinctions, treesize of input 25 treesize of output 13 [2020-07-29 01:33:31,379 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:33:31,390 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:33:31,390 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:33:31,391 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2020-07-29 01:33:34,868 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:33:34,868 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_112|]. (let ((.cse0 (select |v_#memory_int_112| ULTIMATE.start_main_~x~0.base))) (let ((.cse1 (select .cse0 ULTIMATE.start_main_~x~0.offset))) (and (= |#memory_int| (store |v_#memory_int_112| ULTIMATE.start_main_~x~0.base (store .cse0 ULTIMATE.start_main_~x~0.offset (+ .cse1 1)))) (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (<= 4 .cse1) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded))) [2020-07-29 01:33:34,868 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded (<= 5 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))) [2020-07-29 01:33:34,926 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 0 case distinctions, treesize of input 25 treesize of output 13 [2020-07-29 01:33:34,928 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:33:34,939 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:33:34,940 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:33:34,940 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2020-07-29 01:33:37,670 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:33:37,670 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_113|]. (let ((.cse0 (select |v_#memory_int_113| ULTIMATE.start_main_~x~0.base))) (let ((.cse1 (select .cse0 ULTIMATE.start_main_~x~0.offset))) (and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (= |#memory_int| (store |v_#memory_int_113| ULTIMATE.start_main_~x~0.base (store .cse0 ULTIMATE.start_main_~x~0.offset (+ .cse1 1)))) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded (<= 5 .cse1)))) [2020-07-29 01:33:37,670 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded (<= 6 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))) [2020-07-29 01:33:37,749 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 0 case distinctions, treesize of input 25 treesize of output 13 [2020-07-29 01:33:37,752 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:33:37,764 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:33:37,764 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:33:37,765 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2020-07-29 01:33:41,435 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:33:41,436 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_114|]. (let ((.cse0 (select |v_#memory_int_114| ULTIMATE.start_main_~x~0.base))) (let ((.cse1 (select .cse0 ULTIMATE.start_main_~x~0.offset))) (and (= (store |v_#memory_int_114| ULTIMATE.start_main_~x~0.base (store .cse0 ULTIMATE.start_main_~x~0.offset (+ .cse1 1))) |#memory_int|) (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (<= 6 .cse1) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded))) [2020-07-29 01:33:41,436 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (<= 7 (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_~x~0.base)) unseeded) [2020-07-29 01:33:41,516 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 0 case distinctions, treesize of input 25 treesize of output 13 [2020-07-29 01:33:41,520 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:33:41,531 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:33:41,531 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:33:41,532 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2020-07-29 01:33:44,356 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:33:44,356 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_115|]. (let ((.cse1 (select |v_#memory_int_115| ULTIMATE.start_main_~x~0.base))) (let ((.cse0 (select .cse1 ULTIMATE.start_main_~x~0.offset))) (and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (<= 7 .cse0) (= (store |v_#memory_int_115| ULTIMATE.start_main_~x~0.base (store .cse1 ULTIMATE.start_main_~x~0.offset (+ .cse0 1))) |#memory_int|) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded))) [2020-07-29 01:33:44,356 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (<= 8 (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_~x~0.base)) unseeded) [2020-07-29 01:33:44,405 INFO L280 TraceCheckUtils]: 0: Hoare triple {2063#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2063#unseeded} is VALID [2020-07-29 01:33:44,409 INFO L280 TraceCheckUtils]: 1: Hoare triple {2063#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; {2292#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} is VALID [2020-07-29 01:33:44,411 INFO L280 TraceCheckUtils]: 2: Hoare triple {2292#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); {2292#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} is VALID [2020-07-29 01:33:44,412 INFO L280 TraceCheckUtils]: 3: Hoare triple {2292#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2299#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (<= |ULTIMATE.start_main_#t~mem8| (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} is VALID [2020-07-29 01:33:44,413 INFO L280 TraceCheckUtils]: 4: Hoare triple {2299#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (<= |ULTIMATE.start_main_#t~mem8| (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; {2280#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (>= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (- 2)) 0) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:33:44,415 INFO L280 TraceCheckUtils]: 5: Hoare triple {2280#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (>= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (- 2)) 0) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2280#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (>= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (- 2)) 0) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:33:44,417 INFO L280 TraceCheckUtils]: 6: Hoare triple {2280#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (>= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (- 2)) 0) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem14;havoc main_#t~post15; {2309#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (<= 3 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:33:44,418 INFO L280 TraceCheckUtils]: 7: Hoare triple {2309#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (<= 3 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2309#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (<= 3 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:33:44,420 INFO L280 TraceCheckUtils]: 8: Hoare triple {2309#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (<= 3 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem19;havoc main_#t~post20; {2316#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= 4 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) unseeded)} is VALID [2020-07-29 01:33:44,421 INFO L280 TraceCheckUtils]: 9: Hoare triple {2316#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= 4 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) unseeded)} call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2316#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= 4 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) unseeded)} is VALID [2020-07-29 01:33:44,423 INFO L280 TraceCheckUtils]: 10: Hoare triple {2316#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= 4 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) unseeded)} assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; {2323#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded (<= 5 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)))} is VALID [2020-07-29 01:33:44,424 INFO L280 TraceCheckUtils]: 11: Hoare triple {2323#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded (<= 5 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)))} call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2323#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded (<= 5 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)))} is VALID [2020-07-29 01:33:44,426 INFO L280 TraceCheckUtils]: 12: Hoare triple {2323#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded (<= 5 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)))} assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem29;havoc main_#t~post30; {2330#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= 6 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) unseeded)} is VALID [2020-07-29 01:33:44,427 INFO L280 TraceCheckUtils]: 13: Hoare triple {2330#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= 6 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) unseeded)} call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2330#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= 6 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) unseeded)} is VALID [2020-07-29 01:33:44,429 INFO L280 TraceCheckUtils]: 14: Hoare triple {2330#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= 6 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) unseeded)} assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; {2337#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (<= 7 (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_~x~0.base)) unseeded)} is VALID [2020-07-29 01:33:44,430 INFO L280 TraceCheckUtils]: 15: Hoare triple {2337#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (<= 7 (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_~x~0.base)) unseeded)} call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2337#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (<= 7 (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_~x~0.base)) unseeded)} is VALID [2020-07-29 01:33:44,432 INFO L280 TraceCheckUtils]: 16: Hoare triple {2337#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (<= 7 (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_~x~0.base)) unseeded)} assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; {2344#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (<= 8 (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_~x~0.base)) unseeded)} is VALID [2020-07-29 01:33:44,433 INFO L280 TraceCheckUtils]: 17: Hoare triple {2344#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (<= 8 (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_~x~0.base)) unseeded)} call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2344#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (<= 8 (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_~x~0.base)) unseeded)} is VALID [2020-07-29 01:33:44,435 INFO L280 TraceCheckUtils]: 18: Hoare triple {2344#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (<= 8 (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_~x~0.base)) unseeded)} assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post45;havoc main_#t~mem44; {2280#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (>= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (- 2)) 0) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:33:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:33:44,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:33:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:33:44,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:33:44,490 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:33:44,677 INFO L280 TraceCheckUtils]: 0: Hoare triple {2281#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (>= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (- 2)) 0) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (>= oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)) 100)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; {2351#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (or (not |ULTIMATE.start_main_#t~short50|) (<= (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 99)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (<= 100 (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) oldRank0)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= 2 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)))} is VALID [2020-07-29 01:33:44,679 INFO L280 TraceCheckUtils]: 1: Hoare triple {2351#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (or (not |ULTIMATE.start_main_#t~short50|) (<= (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) 99)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (<= 100 (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) oldRank0)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= 2 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)))} assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; {2355#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (<= 100 (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) oldRank0)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= 2 (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) 99))} is VALID [2020-07-29 01:33:44,683 INFO L280 TraceCheckUtils]: 2: Hoare triple {2355#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (<= 100 (+ (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset) oldRank0)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) (<= 2 (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) 99))} assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; {2283#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (>= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) (- 2)) 0) (or (and (> oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)) 100)) (>= oldRank0 0)) unseeded) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} is VALID [2020-07-29 01:33:44,684 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:33:44,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 01:33:44,747 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:33:44,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:33:44,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:44,753 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 3 loop predicates [2020-07-29 01:33:44,754 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 63 transitions. cyclomatic complexity: 14 Second operand 13 states. [2020-07-29 01:33:45,918 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 63 transitions. cyclomatic complexity: 14. Second operand 13 states. Result 65 states and 82 transitions. Complement of second has 17 states. [2020-07-29 01:33:45,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2020-07-29 01:33:45,918 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:33:45,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 63 transitions. cyclomatic complexity: 14 [2020-07-29 01:33:45,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:33:45,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:33:45,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-07-29 01:33:45,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:45,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:33:45,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:33:45,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 82 transitions. [2020-07-29 01:33:45,926 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:33:45,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:33:45,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:33:45,930 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 50 states and 63 transitions. cyclomatic complexity: 14 [2020-07-29 01:33:45,931 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:33:45,932 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states. [2020-07-29 01:33:45,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:45,934 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:33:45,934 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 65 states and 82 transitions. cyclomatic complexity: 20 [2020-07-29 01:33:45,937 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:33:45,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 63 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:33:45,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:33:45,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 82 transitions. cyclomatic complexity: 20 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:33:45,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 63 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:33:45,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:33:45,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 82 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:33:45,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 63 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:33:45,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:33:45,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 82 transitions. cyclomatic complexity: 20 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:33:45,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 63 transitions. cyclomatic complexity: 14 Stem has 65 letters. Loop has 65 letters. [2020-07-29 01:33:45,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 65 letters. Loop has 65 letters. [2020-07-29 01:33:45,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 82 transitions. cyclomatic complexity: 20 Stem has 65 letters. Loop has 65 letters. [2020-07-29 01:33:45,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 63 transitions. cyclomatic complexity: 14 Stem has 50 letters. Loop has 50 letters. [2020-07-29 01:33:45,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 50 letters. Loop has 50 letters. [2020-07-29 01:33:45,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 82 transitions. cyclomatic complexity: 20 Stem has 50 letters. Loop has 50 letters. [2020-07-29 01:33:45,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 63 transitions. cyclomatic complexity: 14 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:33:45,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:33:45,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 82 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:33:45,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 63 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:33:45,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:33:45,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 82 transitions. cyclomatic complexity: 20 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:33:45,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 63 transitions. cyclomatic complexity: 14 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:33:45,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:33:45,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 82 transitions. cyclomatic complexity: 20 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:33:45,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 63 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:33:45,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:33:45,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 82 transitions. cyclomatic complexity: 20 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:33:45,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 63 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:33:45,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:33:45,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 82 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:33:45,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 63 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:33:45,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:33:45,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 82 transitions. cyclomatic complexity: 20 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:33:45,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 63 transitions. cyclomatic complexity: 14 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:33:45,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:33:45,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 82 transitions. cyclomatic complexity: 20 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:33:45,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 63 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:33:45,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:33:45,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 82 transitions. cyclomatic complexity: 20 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:33:45,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 63 transitions. cyclomatic complexity: 14 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:33:45,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:33:45,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 82 transitions. cyclomatic complexity: 20 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:33:45,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 63 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:33:45,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:33:45,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 82 transitions. cyclomatic complexity: 20 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:33:45,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 63 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 3 letters. [2020-07-29 01:33:45,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 23 letters. Loop has 3 letters. [2020-07-29 01:33:45,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 82 transitions. cyclomatic complexity: 20 Stem has 23 letters. Loop has 3 letters. [2020-07-29 01:33:45,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,955 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:33:45,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:33:45,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2020-07-29 01:33:45,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 51 transitions. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:33:45,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 51 transitions. Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:33:45,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 51 transitions. Stem has 19 letters. Loop has 6 letters. [2020-07-29 01:33:45,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:33:45,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 82 transitions. cyclomatic complexity: 20 [2020-07-29 01:33:45,961 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:33:45,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 41 states and 54 transitions. [2020-07-29 01:33:45,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2020-07-29 01:33:45,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2020-07-29 01:33:45,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 54 transitions. [2020-07-29 01:33:45,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:33:45,964 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2020-07-29 01:33:45,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 54 transitions. [2020-07-29 01:33:45,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2020-07-29 01:33:45,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:33:45,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states and 54 transitions. Second operand 36 states. [2020-07-29 01:33:45,967 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states and 54 transitions. Second operand 36 states. [2020-07-29 01:33:45,967 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand 36 states. [2020-07-29 01:33:45,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:45,968 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2020-07-29 01:33:45,969 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2020-07-29 01:33:45,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:45,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:45,969 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 41 states and 54 transitions. [2020-07-29 01:33:45,970 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 41 states and 54 transitions. [2020-07-29 01:33:45,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:45,971 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2020-07-29 01:33:45,971 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2020-07-29 01:33:45,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:45,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:45,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:33:45,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:33:45,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-29 01:33:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2020-07-29 01:33:45,974 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2020-07-29 01:33:45,974 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2020-07-29 01:33:45,974 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2020-07-29 01:33:45,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2020-07-29 01:33:45,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:45,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:33:45,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:33:45,976 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:33:45,976 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:33:45,976 INFO L794 eck$LassoCheckResult]: Stem: 2481#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2476#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 2477#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 2478#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2458#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; 2459#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2465#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem14;havoc main_#t~post15; 2479#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2460#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem19;havoc main_#t~post20; 2461#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2491#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; 2489#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2463#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem29;havoc main_#t~post30; 2464#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2486#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 2483#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2466#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 2467#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2484#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post45;havoc main_#t~mem44; 2475#L598-4 [2020-07-29 01:33:45,976 INFO L796 eck$LassoCheckResult]: Loop: 2475#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 2469#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 2470#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 2475#L598-4 [2020-07-29 01:33:45,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:45,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1913077182, now seen corresponding path program 1 times [2020-07-29 01:33:45,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:45,978 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365245922] [2020-07-29 01:33:45,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:33:46,071 INFO L280 TraceCheckUtils]: 0: Hoare triple {2579#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2579#true} is VALID [2020-07-29 01:33:46,071 INFO L280 TraceCheckUtils]: 1: Hoare triple {2579#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; {2579#true} is VALID [2020-07-29 01:33:46,073 INFO L280 TraceCheckUtils]: 2: Hoare triple {2579#true} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); {2581#(= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1))} is VALID [2020-07-29 01:33:46,073 INFO L280 TraceCheckUtils]: 3: Hoare triple {2581#(= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1))} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2582#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1) 0)} is VALID [2020-07-29 01:33:46,075 INFO L280 TraceCheckUtils]: 4: Hoare triple {2582#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1) 0)} assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; {2583#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0)} is VALID [2020-07-29 01:33:46,075 INFO L280 TraceCheckUtils]: 5: Hoare triple {2583#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0)} call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2584#(<= (+ |ULTIMATE.start_main_#t~mem13| 2) 0)} is VALID [2020-07-29 01:33:46,076 INFO L280 TraceCheckUtils]: 6: Hoare triple {2584#(<= (+ |ULTIMATE.start_main_#t~mem13| 2) 0)} assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem14;havoc main_#t~post15; {2580#false} is VALID [2020-07-29 01:33:46,077 INFO L280 TraceCheckUtils]: 7: Hoare triple {2580#false} call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2580#false} is VALID [2020-07-29 01:33:46,077 INFO L280 TraceCheckUtils]: 8: Hoare triple {2580#false} assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem19;havoc main_#t~post20; {2580#false} is VALID [2020-07-29 01:33:46,077 INFO L280 TraceCheckUtils]: 9: Hoare triple {2580#false} call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2580#false} is VALID [2020-07-29 01:33:46,077 INFO L280 TraceCheckUtils]: 10: Hoare triple {2580#false} assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; {2580#false} is VALID [2020-07-29 01:33:46,077 INFO L280 TraceCheckUtils]: 11: Hoare triple {2580#false} call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2580#false} is VALID [2020-07-29 01:33:46,078 INFO L280 TraceCheckUtils]: 12: Hoare triple {2580#false} assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem29;havoc main_#t~post30; {2580#false} is VALID [2020-07-29 01:33:46,078 INFO L280 TraceCheckUtils]: 13: Hoare triple {2580#false} call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2580#false} is VALID [2020-07-29 01:33:46,078 INFO L280 TraceCheckUtils]: 14: Hoare triple {2580#false} assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; {2580#false} is VALID [2020-07-29 01:33:46,078 INFO L280 TraceCheckUtils]: 15: Hoare triple {2580#false} call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2580#false} is VALID [2020-07-29 01:33:46,078 INFO L280 TraceCheckUtils]: 16: Hoare triple {2580#false} assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; {2580#false} is VALID [2020-07-29 01:33:46,079 INFO L280 TraceCheckUtils]: 17: Hoare triple {2580#false} call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2580#false} is VALID [2020-07-29 01:33:46,079 INFO L280 TraceCheckUtils]: 18: Hoare triple {2580#false} assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post45;havoc main_#t~mem44; {2580#false} is VALID [2020-07-29 01:33:46,079 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:33:46,080 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365245922] [2020-07-29 01:33:46,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:33:46,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:33:46,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62882156] [2020-07-29 01:33:46,080 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:33:46,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:46,081 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 11 times [2020-07-29 01:33:46,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:46,081 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598272480] [2020-07-29 01:33:46,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:46,106 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:46,123 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:46,126 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:33:46,319 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-29 01:33:46,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:33:46,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:33:46,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:33:46,388 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. cyclomatic complexity: 12 Second operand 6 states. [2020-07-29 01:33:47,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:47,000 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2020-07-29 01:33:47,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:33:47,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:33:47,041 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:33:47,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 65 transitions. [2020-07-29 01:33:47,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:47,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 65 transitions. [2020-07-29 01:33:47,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2020-07-29 01:33:47,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2020-07-29 01:33:47,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 65 transitions. [2020-07-29 01:33:47,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:33:47,045 INFO L688 BuchiCegarLoop]: Abstraction has 50 states and 65 transitions. [2020-07-29 01:33:47,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 65 transitions. [2020-07-29 01:33:47,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 32. [2020-07-29 01:33:47,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:33:47,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states and 65 transitions. Second operand 32 states. [2020-07-29 01:33:47,048 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states and 65 transitions. Second operand 32 states. [2020-07-29 01:33:47,048 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. Second operand 32 states. [2020-07-29 01:33:47,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:47,050 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2020-07-29 01:33:47,050 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2020-07-29 01:33:47,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:47,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:47,051 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 50 states and 65 transitions. [2020-07-29 01:33:47,051 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 50 states and 65 transitions. [2020-07-29 01:33:47,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:47,053 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2020-07-29 01:33:47,053 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2020-07-29 01:33:47,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:47,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:47,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:33:47,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:33:47,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-29 01:33:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2020-07-29 01:33:47,055 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 40 transitions. [2020-07-29 01:33:47,055 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 40 transitions. [2020-07-29 01:33:47,055 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2020-07-29 01:33:47,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 40 transitions. [2020-07-29 01:33:47,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:47,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:33:47,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:33:47,057 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:33:47,057 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:33:47,057 INFO L794 eck$LassoCheckResult]: Stem: 2660#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2656#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 2657#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 2659#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2639#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; 2640#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2646#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 2661#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2641#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem19;havoc main_#t~post20; 2642#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2650#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; 2662#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2644#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem29;havoc main_#t~post30; 2645#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2666#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 2663#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2647#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 2648#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2655#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post45;havoc main_#t~mem44; 2658#L598-4 [2020-07-29 01:33:47,058 INFO L796 eck$LassoCheckResult]: Loop: 2658#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 2651#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 2652#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 2658#L598-4 [2020-07-29 01:33:47,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:47,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1326271168, now seen corresponding path program 1 times [2020-07-29 01:33:47,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:47,059 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232135797] [2020-07-29 01:33:47,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:33:47,141 INFO L280 TraceCheckUtils]: 0: Hoare triple {2774#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2774#true} is VALID [2020-07-29 01:33:47,142 INFO L280 TraceCheckUtils]: 1: Hoare triple {2774#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; {2774#true} is VALID [2020-07-29 01:33:47,143 INFO L280 TraceCheckUtils]: 2: Hoare triple {2774#true} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); {2776#(= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1))} is VALID [2020-07-29 01:33:47,145 INFO L280 TraceCheckUtils]: 3: Hoare triple {2776#(= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1))} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2777#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1) 0)} is VALID [2020-07-29 01:33:47,146 INFO L280 TraceCheckUtils]: 4: Hoare triple {2777#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1) 0)} assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; {2778#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0)} is VALID [2020-07-29 01:33:47,152 INFO L280 TraceCheckUtils]: 5: Hoare triple {2778#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0)} call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2778#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0)} is VALID [2020-07-29 01:33:47,154 INFO L280 TraceCheckUtils]: 6: Hoare triple {2778#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0)} assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; {2779#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 0)} is VALID [2020-07-29 01:33:47,155 INFO L280 TraceCheckUtils]: 7: Hoare triple {2779#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 0)} call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2780#(<= (+ |ULTIMATE.start_main_#t~mem18| 3) 0)} is VALID [2020-07-29 01:33:47,156 INFO L280 TraceCheckUtils]: 8: Hoare triple {2780#(<= (+ |ULTIMATE.start_main_#t~mem18| 3) 0)} assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem19;havoc main_#t~post20; {2775#false} is VALID [2020-07-29 01:33:47,156 INFO L280 TraceCheckUtils]: 9: Hoare triple {2775#false} call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2775#false} is VALID [2020-07-29 01:33:47,156 INFO L280 TraceCheckUtils]: 10: Hoare triple {2775#false} assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; {2775#false} is VALID [2020-07-29 01:33:47,156 INFO L280 TraceCheckUtils]: 11: Hoare triple {2775#false} call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2775#false} is VALID [2020-07-29 01:33:47,156 INFO L280 TraceCheckUtils]: 12: Hoare triple {2775#false} assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem29;havoc main_#t~post30; {2775#false} is VALID [2020-07-29 01:33:47,157 INFO L280 TraceCheckUtils]: 13: Hoare triple {2775#false} call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2775#false} is VALID [2020-07-29 01:33:47,157 INFO L280 TraceCheckUtils]: 14: Hoare triple {2775#false} assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; {2775#false} is VALID [2020-07-29 01:33:47,157 INFO L280 TraceCheckUtils]: 15: Hoare triple {2775#false} call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2775#false} is VALID [2020-07-29 01:33:47,157 INFO L280 TraceCheckUtils]: 16: Hoare triple {2775#false} assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; {2775#false} is VALID [2020-07-29 01:33:47,157 INFO L280 TraceCheckUtils]: 17: Hoare triple {2775#false} call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2775#false} is VALID [2020-07-29 01:33:47,157 INFO L280 TraceCheckUtils]: 18: Hoare triple {2775#false} assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post45;havoc main_#t~mem44; {2775#false} is VALID [2020-07-29 01:33:47,158 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:33:47,158 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232135797] [2020-07-29 01:33:47,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:33:47,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-29 01:33:47,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326936308] [2020-07-29 01:33:47,159 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:33:47,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:47,159 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 12 times [2020-07-29 01:33:47,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:47,159 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968439162] [2020-07-29 01:33:47,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:47,169 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:47,177 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:47,179 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:33:47,412 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-29 01:33:47,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:33:47,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:33:47,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:33:47,507 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. cyclomatic complexity: 9 Second operand 7 states. [2020-07-29 01:33:48,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:48,556 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2020-07-29 01:33:48,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:33:48,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:33:48,604 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:33:48,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 72 transitions. [2020-07-29 01:33:48,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:48,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 72 transitions. [2020-07-29 01:33:48,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2020-07-29 01:33:48,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2020-07-29 01:33:48,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 72 transitions. [2020-07-29 01:33:48,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:33:48,611 INFO L688 BuchiCegarLoop]: Abstraction has 55 states and 72 transitions. [2020-07-29 01:33:48,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 72 transitions. [2020-07-29 01:33:48,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2020-07-29 01:33:48,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:33:48,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states and 72 transitions. Second operand 28 states. [2020-07-29 01:33:48,613 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states and 72 transitions. Second operand 28 states. [2020-07-29 01:33:48,613 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand 28 states. [2020-07-29 01:33:48,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:48,615 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2020-07-29 01:33:48,615 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2020-07-29 01:33:48,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:48,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:48,616 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 55 states and 72 transitions. [2020-07-29 01:33:48,616 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 55 states and 72 transitions. [2020-07-29 01:33:48,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:48,618 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2020-07-29 01:33:48,618 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2020-07-29 01:33:48,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:48,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:48,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:33:48,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:33:48,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-29 01:33:48,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2020-07-29 01:33:48,621 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-07-29 01:33:48,621 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-07-29 01:33:48,621 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2020-07-29 01:33:48,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2020-07-29 01:33:48,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:48,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:33:48,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:33:48,623 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:33:48,623 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:33:48,623 INFO L794 eck$LassoCheckResult]: Stem: 2859#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2856#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 2857#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 2858#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2840#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; 2841#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2846#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 2860#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2842#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 2843#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2852#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; 2861#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2844#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 2845#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2853#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 2864#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2847#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 2848#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2865#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post45;havoc main_#t~mem44; 2855#L598-4 [2020-07-29 01:33:48,623 INFO L796 eck$LassoCheckResult]: Loop: 2855#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 2850#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 2851#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 2855#L598-4 [2020-07-29 01:33:48,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:48,624 INFO L82 PathProgramCache]: Analyzing trace with hash -492624188, now seen corresponding path program 1 times [2020-07-29 01:33:48,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:48,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217189129] [2020-07-29 01:33:48,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:33:48,801 INFO L280 TraceCheckUtils]: 0: Hoare triple {2981#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2981#true} is VALID [2020-07-29 01:33:48,801 INFO L280 TraceCheckUtils]: 1: Hoare triple {2981#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; {2981#true} is VALID [2020-07-29 01:33:48,803 INFO L280 TraceCheckUtils]: 2: Hoare triple {2981#true} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); {2983#(= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1))} is VALID [2020-07-29 01:33:48,804 INFO L280 TraceCheckUtils]: 3: Hoare triple {2983#(= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1))} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2984#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1) 0)} is VALID [2020-07-29 01:33:48,805 INFO L280 TraceCheckUtils]: 4: Hoare triple {2984#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1) 0)} assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; {2985#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0)} is VALID [2020-07-29 01:33:48,806 INFO L280 TraceCheckUtils]: 5: Hoare triple {2985#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0)} call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2985#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0)} is VALID [2020-07-29 01:33:48,808 INFO L280 TraceCheckUtils]: 6: Hoare triple {2985#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0)} assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; {2986#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 0)} is VALID [2020-07-29 01:33:48,808 INFO L280 TraceCheckUtils]: 7: Hoare triple {2986#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 0)} call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2986#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 0)} is VALID [2020-07-29 01:33:48,810 INFO L280 TraceCheckUtils]: 8: Hoare triple {2986#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 0)} assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; {2987#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 4) 0)} is VALID [2020-07-29 01:33:48,811 INFO L280 TraceCheckUtils]: 9: Hoare triple {2987#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 4) 0)} call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2988#(and (<= (+ |ULTIMATE.start_main_#t~mem23| 4) 0) (= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) |ULTIMATE.start_main_#t~mem23|))} is VALID [2020-07-29 01:33:48,813 INFO L280 TraceCheckUtils]: 10: Hoare triple {2988#(and (<= (+ |ULTIMATE.start_main_#t~mem23| 4) 0) (= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) |ULTIMATE.start_main_#t~mem23|))} assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; {2989#(<= 7 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} is VALID [2020-07-29 01:33:48,814 INFO L280 TraceCheckUtils]: 11: Hoare triple {2989#(<= 7 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))} call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2990#(<= 7 |ULTIMATE.start_main_#t~mem28|)} is VALID [2020-07-29 01:33:48,816 INFO L280 TraceCheckUtils]: 12: Hoare triple {2990#(<= 7 |ULTIMATE.start_main_#t~mem28|)} assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; {2982#false} is VALID [2020-07-29 01:33:48,816 INFO L280 TraceCheckUtils]: 13: Hoare triple {2982#false} call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2982#false} is VALID [2020-07-29 01:33:48,816 INFO L280 TraceCheckUtils]: 14: Hoare triple {2982#false} assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; {2982#false} is VALID [2020-07-29 01:33:48,816 INFO L280 TraceCheckUtils]: 15: Hoare triple {2982#false} call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2982#false} is VALID [2020-07-29 01:33:48,817 INFO L280 TraceCheckUtils]: 16: Hoare triple {2982#false} assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; {2982#false} is VALID [2020-07-29 01:33:48,817 INFO L280 TraceCheckUtils]: 17: Hoare triple {2982#false} call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); {2982#false} is VALID [2020-07-29 01:33:48,817 INFO L280 TraceCheckUtils]: 18: Hoare triple {2982#false} assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post45;havoc main_#t~mem44; {2982#false} is VALID [2020-07-29 01:33:48,818 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:33:48,818 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217189129] [2020-07-29 01:33:48,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:33:48,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-29 01:33:48,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483302790] [2020-07-29 01:33:48,819 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:33:48,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:48,821 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 13 times [2020-07-29 01:33:48,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:48,821 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104030854] [2020-07-29 01:33:48,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:48,831 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:48,842 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:48,846 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:33:49,087 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-29 01:33:49,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:33:49,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:33:49,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:33:49,182 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. cyclomatic complexity: 8 Second operand 10 states. [2020-07-29 01:33:50,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:50,070 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2020-07-29 01:33:50,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:33:50,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:33:50,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:33:50,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2020-07-29 01:33:50,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:50,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 51 transitions. [2020-07-29 01:33:50,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2020-07-29 01:33:50,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2020-07-29 01:33:50,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2020-07-29 01:33:50,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:33:50,116 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2020-07-29 01:33:50,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2020-07-29 01:33:50,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2020-07-29 01:33:50,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:33:50,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states and 51 transitions. Second operand 26 states. [2020-07-29 01:33:50,118 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states and 51 transitions. Second operand 26 states. [2020-07-29 01:33:50,118 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand 26 states. [2020-07-29 01:33:50,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:50,120 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2020-07-29 01:33:50,120 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2020-07-29 01:33:50,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:50,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:50,120 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 41 states and 51 transitions. [2020-07-29 01:33:50,121 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 41 states and 51 transitions. [2020-07-29 01:33:50,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:50,122 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2020-07-29 01:33:50,122 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2020-07-29 01:33:50,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:50,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:50,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:33:50,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:33:50,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-29 01:33:50,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2020-07-29 01:33:50,124 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2020-07-29 01:33:50,124 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2020-07-29 01:33:50,124 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2020-07-29 01:33:50,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2020-07-29 01:33:50,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:50,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:33:50,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:33:50,125 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:33:50,126 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:33:50,126 INFO L794 eck$LassoCheckResult]: Stem: 3054#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3051#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 3052#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 3053#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3034#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; 3035#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3044#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 3055#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3036#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 3037#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3047#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; 3056#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3038#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem29;havoc main_#t~post30; 3039#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3048#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 3058#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3041#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 3042#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3049#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post45;havoc main_#t~mem44; 3050#L598-4 [2020-07-29 01:33:50,126 INFO L796 eck$LassoCheckResult]: Loop: 3050#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 3045#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 3046#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 3050#L598-4 [2020-07-29 01:33:50,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:50,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1587573180, now seen corresponding path program 1 times [2020-07-29 01:33:50,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:50,127 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966555446] [2020-07-29 01:33:50,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:33:50,259 INFO L280 TraceCheckUtils]: 0: Hoare triple {3145#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3145#true} is VALID [2020-07-29 01:33:50,259 INFO L280 TraceCheckUtils]: 1: Hoare triple {3145#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; {3145#true} is VALID [2020-07-29 01:33:50,261 INFO L280 TraceCheckUtils]: 2: Hoare triple {3145#true} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); {3147#(= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1))} is VALID [2020-07-29 01:33:50,264 INFO L280 TraceCheckUtils]: 3: Hoare triple {3147#(= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1))} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3148#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1) 0)} is VALID [2020-07-29 01:33:50,265 INFO L280 TraceCheckUtils]: 4: Hoare triple {3148#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1) 0)} assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; {3149#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0)} is VALID [2020-07-29 01:33:50,270 INFO L280 TraceCheckUtils]: 5: Hoare triple {3149#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0)} call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3149#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0)} is VALID [2020-07-29 01:33:50,272 INFO L280 TraceCheckUtils]: 6: Hoare triple {3149#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0)} assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; {3150#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 0)} is VALID [2020-07-29 01:33:50,273 INFO L280 TraceCheckUtils]: 7: Hoare triple {3150#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 0)} call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3150#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 0)} is VALID [2020-07-29 01:33:50,274 INFO L280 TraceCheckUtils]: 8: Hoare triple {3150#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 0)} assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; {3151#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 4) 0)} is VALID [2020-07-29 01:33:50,275 INFO L280 TraceCheckUtils]: 9: Hoare triple {3151#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 4) 0)} call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3151#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 4) 0)} is VALID [2020-07-29 01:33:50,276 INFO L280 TraceCheckUtils]: 10: Hoare triple {3151#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 4) 0)} assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; {3152#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 5) 0)} is VALID [2020-07-29 01:33:50,276 INFO L280 TraceCheckUtils]: 11: Hoare triple {3152#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 5) 0)} call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3153#(<= (+ |ULTIMATE.start_main_#t~mem28| 5) 0)} is VALID [2020-07-29 01:33:50,277 INFO L280 TraceCheckUtils]: 12: Hoare triple {3153#(<= (+ |ULTIMATE.start_main_#t~mem28| 5) 0)} assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem29;havoc main_#t~post30; {3146#false} is VALID [2020-07-29 01:33:50,278 INFO L280 TraceCheckUtils]: 13: Hoare triple {3146#false} call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3146#false} is VALID [2020-07-29 01:33:50,278 INFO L280 TraceCheckUtils]: 14: Hoare triple {3146#false} assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; {3146#false} is VALID [2020-07-29 01:33:50,278 INFO L280 TraceCheckUtils]: 15: Hoare triple {3146#false} call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3146#false} is VALID [2020-07-29 01:33:50,279 INFO L280 TraceCheckUtils]: 16: Hoare triple {3146#false} assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; {3146#false} is VALID [2020-07-29 01:33:50,279 INFO L280 TraceCheckUtils]: 17: Hoare triple {3146#false} call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3146#false} is VALID [2020-07-29 01:33:50,279 INFO L280 TraceCheckUtils]: 18: Hoare triple {3146#false} assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post45;havoc main_#t~mem44; {3146#false} is VALID [2020-07-29 01:33:50,280 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:33:50,280 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966555446] [2020-07-29 01:33:50,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:33:50,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-29 01:33:50,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264089269] [2020-07-29 01:33:50,281 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:33:50,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:50,281 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 14 times [2020-07-29 01:33:50,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:50,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172858455] [2020-07-29 01:33:50,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:50,294 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:50,302 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:50,314 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:33:50,508 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-29 01:33:50,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:33:50,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:33:50,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:33:50,584 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. cyclomatic complexity: 6 Second operand 9 states. [2020-07-29 01:33:51,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:51,192 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2020-07-29 01:33:51,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:33:51,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:33:51,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:33:51,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2020-07-29 01:33:51,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:51,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 39 transitions. [2020-07-29 01:33:51,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2020-07-29 01:33:51,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2020-07-29 01:33:51,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2020-07-29 01:33:51,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:33:51,234 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2020-07-29 01:33:51,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2020-07-29 01:33:51,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2020-07-29 01:33:51,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:33:51,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states and 39 transitions. Second operand 24 states. [2020-07-29 01:33:51,235 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states and 39 transitions. Second operand 24 states. [2020-07-29 01:33:51,235 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 24 states. [2020-07-29 01:33:51,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:51,236 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2020-07-29 01:33:51,236 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2020-07-29 01:33:51,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:51,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:51,237 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 33 states and 39 transitions. [2020-07-29 01:33:51,237 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 33 states and 39 transitions. [2020-07-29 01:33:51,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:51,238 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2020-07-29 01:33:51,238 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2020-07-29 01:33:51,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:51,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:51,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:33:51,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:33:51,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:33:51,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2020-07-29 01:33:51,240 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2020-07-29 01:33:51,240 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2020-07-29 01:33:51,241 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2020-07-29 01:33:51,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2020-07-29 01:33:51,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:51,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:33:51,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:33:51,242 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:33:51,242 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:33:51,243 INFO L794 eck$LassoCheckResult]: Stem: 3210#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3206#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 3207#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 3209#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3191#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; 3192#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3197#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 3211#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3193#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 3194#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3201#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; 3212#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3195#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 3196#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3204#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; 3213#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3198#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 3199#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3214#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post45;havoc main_#t~mem44; 3208#L598-4 [2020-07-29 01:33:51,243 INFO L796 eck$LassoCheckResult]: Loop: 3208#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 3202#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 3203#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 3208#L598-4 [2020-07-29 01:33:51,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:51,243 INFO L82 PathProgramCache]: Analyzing trace with hash 189281224, now seen corresponding path program 1 times [2020-07-29 01:33:51,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:51,244 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770626331] [2020-07-29 01:33:51,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:33:51,425 INFO L280 TraceCheckUtils]: 0: Hoare triple {3284#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3284#true} is VALID [2020-07-29 01:33:51,425 INFO L280 TraceCheckUtils]: 1: Hoare triple {3284#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; {3284#true} is VALID [2020-07-29 01:33:51,427 INFO L280 TraceCheckUtils]: 2: Hoare triple {3284#true} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); {3286#(= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1))} is VALID [2020-07-29 01:33:51,429 INFO L280 TraceCheckUtils]: 3: Hoare triple {3286#(= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1))} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3287#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1) 0)} is VALID [2020-07-29 01:33:51,431 INFO L280 TraceCheckUtils]: 4: Hoare triple {3287#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1) 0)} assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; {3288#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0)} is VALID [2020-07-29 01:33:51,432 INFO L280 TraceCheckUtils]: 5: Hoare triple {3288#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0)} call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3288#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0)} is VALID [2020-07-29 01:33:51,433 INFO L280 TraceCheckUtils]: 6: Hoare triple {3288#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0)} assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; {3289#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 0)} is VALID [2020-07-29 01:33:51,434 INFO L280 TraceCheckUtils]: 7: Hoare triple {3289#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 0)} call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3289#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 0)} is VALID [2020-07-29 01:33:51,436 INFO L280 TraceCheckUtils]: 8: Hoare triple {3289#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 0)} assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; {3290#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 4) 0)} is VALID [2020-07-29 01:33:51,437 INFO L280 TraceCheckUtils]: 9: Hoare triple {3290#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 4) 0)} call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3290#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 4) 0)} is VALID [2020-07-29 01:33:51,439 INFO L280 TraceCheckUtils]: 10: Hoare triple {3290#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 4) 0)} assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; {3291#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 5) 0)} is VALID [2020-07-29 01:33:51,439 INFO L280 TraceCheckUtils]: 11: Hoare triple {3291#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 5) 0)} call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3291#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 5) 0)} is VALID [2020-07-29 01:33:51,441 INFO L280 TraceCheckUtils]: 12: Hoare triple {3291#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 5) 0)} assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; {3292#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 6) 0)} is VALID [2020-07-29 01:33:51,442 INFO L280 TraceCheckUtils]: 13: Hoare triple {3292#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 6) 0)} call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3292#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 6) 0)} is VALID [2020-07-29 01:33:51,444 INFO L280 TraceCheckUtils]: 14: Hoare triple {3292#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 6) 0)} assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; {3293#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 7) 0)} is VALID [2020-07-29 01:33:51,445 INFO L280 TraceCheckUtils]: 15: Hoare triple {3293#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 7) 0)} call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3294#(<= (+ |ULTIMATE.start_main_#t~mem38| 7) 0)} is VALID [2020-07-29 01:33:51,447 INFO L280 TraceCheckUtils]: 16: Hoare triple {3294#(<= (+ |ULTIMATE.start_main_#t~mem38| 7) 0)} assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; {3285#false} is VALID [2020-07-29 01:33:51,447 INFO L280 TraceCheckUtils]: 17: Hoare triple {3285#false} call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3285#false} is VALID [2020-07-29 01:33:51,447 INFO L280 TraceCheckUtils]: 18: Hoare triple {3285#false} assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post45;havoc main_#t~mem44; {3285#false} is VALID [2020-07-29 01:33:51,448 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:33:51,449 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770626331] [2020-07-29 01:33:51,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:33:51,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-29 01:33:51,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876348860] [2020-07-29 01:33:51,450 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:33:51,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:51,450 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 15 times [2020-07-29 01:33:51,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:51,450 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939735790] [2020-07-29 01:33:51,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:51,460 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:51,468 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:51,470 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:33:51,685 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-29 01:33:51,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:33:51,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 01:33:51,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:33:51,785 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. cyclomatic complexity: 4 Second operand 11 states. [2020-07-29 01:33:52,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:52,302 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2020-07-29 01:33:52,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:33:52,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 01:33:52,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:33:52,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2020-07-29 01:33:52,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:52,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions. [2020-07-29 01:33:52,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-07-29 01:33:52,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-07-29 01:33:52,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2020-07-29 01:33:52,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:33:52,359 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-07-29 01:33:52,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2020-07-29 01:33:52,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2020-07-29 01:33:52,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:33:52,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states and 32 transitions. Second operand 22 states. [2020-07-29 01:33:52,361 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states and 32 transitions. Second operand 22 states. [2020-07-29 01:33:52,361 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 22 states. [2020-07-29 01:33:52,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:52,362 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2020-07-29 01:33:52,362 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-29 01:33:52,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:52,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:52,362 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 28 states and 32 transitions. [2020-07-29 01:33:52,362 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 28 states and 32 transitions. [2020-07-29 01:33:52,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:33:52,364 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2020-07-29 01:33:52,364 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-29 01:33:52,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:33:52,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:33:52,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:33:52,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:33:52,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 01:33:52,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2020-07-29 01:33:52,366 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-07-29 01:33:52,366 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-07-29 01:33:52,366 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2020-07-29 01:33:52,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2020-07-29 01:33:52,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:33:52,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:33:52,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:33:52,368 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:33:52,368 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:33:52,368 INFO L794 eck$LassoCheckResult]: Stem: 3345#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3341#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 3342#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 3344#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3327#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; 3328#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3333#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 3346#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3329#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 3330#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3336#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; 3347#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3331#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 3332#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3339#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; 3348#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3334#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 3335#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3340#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 3343#L598-4 [2020-07-29 01:33:52,368 INFO L796 eck$LassoCheckResult]: Loop: 3343#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 3337#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 3338#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 3343#L598-4 [2020-07-29 01:33:52,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:52,369 INFO L82 PathProgramCache]: Analyzing trace with hash 189283148, now seen corresponding path program 1 times [2020-07-29 01:33:52,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:52,369 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197301624] [2020-07-29 01:33:52,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:52,383 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:52,395 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:52,401 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:33:52,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:52,402 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 16 times [2020-07-29 01:33:52,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:52,403 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918656932] [2020-07-29 01:33:52,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:52,411 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:52,417 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:52,419 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:33:52,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:33:52,420 INFO L82 PathProgramCache]: Analyzing trace with hash -357729952, now seen corresponding path program 1 times [2020-07-29 01:33:52,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:33:52,420 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588229147] [2020-07-29 01:33:52,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:33:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:52,439 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:33:52,457 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:33:52,463 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:33:52,666 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-29 01:34:00,620 WARN L193 SmtUtils]: Spent 7.86 s on a formula simplification. DAG size of input: 192 DAG size of output: 163 [2020-07-29 01:34:00,890 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-07-29 01:34:00,897 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:34:00,897 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:34:00,897 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:34:00,897 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:34:00,897 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:34:00,897 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:00,897 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:34:00,897 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:34:00,897 INFO L133 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca.i_Iteration16_Lasso [2020-07-29 01:34:00,898 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:34:00,898 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:34:00,938 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:34:00,942 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:34:00,947 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:34:00,951 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:34:00,954 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:34:00,958 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:34:00,962 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:34:00,972 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:34:00,976 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:34:00,987 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:34:00,992 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:34:00,996 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:34:01,589 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2020-07-29 01:34:01,779 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2020-07-29 01:34:01,790 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:34:01,795 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:34:01,802 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:34:01,807 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:34:01,812 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:34:01,817 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:34:01,822 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:34:01,827 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:34:01,832 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:34:01,837 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:34:01,842 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:34:01,847 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:34:01,852 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:34:01,857 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:34:01,863 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:34:01,868 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:34:01,873 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:34:01,880 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:34:01,884 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:34:01,890 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:34:01,895 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:34:01,899 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:34:01,904 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:34:01,910 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:34:01,915 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:34:01,920 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:34:01,924 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:34:01,929 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:34:01,934 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:34:01,939 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:34:01,944 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:34:01,949 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:34:01,954 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:34:01,959 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:34:01,964 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:34:01,969 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:34:01,974 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:34:01,981 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:34:01,991 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:34:01,996 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:34:02,001 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:34:02,011 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:34:02,016 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:34:02,022 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:34:02,027 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:34:02,896 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2020-07-29 01:34:03,913 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:34:03,914 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:03,922 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:03,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:03,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:03,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:03,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:03,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:03,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:03,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:03,926 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 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:03,949 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:34:03,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:03,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:03,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:03,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:03,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:03,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:03,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:03,953 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 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:03,976 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:34:03,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:03,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:03,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:03,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:03,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:03,979 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:03,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:03,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 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:04,003 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:34:04,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:04,005 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:04,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:04,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:04,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:04,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:04,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:04,008 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 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:04,030 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:34:04,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:04,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:04,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:04,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:04,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:04,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:04,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:04,034 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 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:04,057 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:34:04,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:04,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:04,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:04,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:04,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:04,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:04,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:04,060 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 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:04,083 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:34:04,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:04,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:04,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:04,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:04,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:04,085 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:04,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:04,086 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 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:04,110 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:34:04,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:04,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:04,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:04,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:04,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:04,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:04,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:04,113 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:04,137 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:34:04,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:04,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:04,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:04,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:04,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:04,140 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:04,140 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:04,142 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 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:04,164 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:34:04,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:04,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:04,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:04,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:04,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:04,166 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:04,167 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:04,168 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 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:04,191 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:34:04,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:04,192 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:04,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:04,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:04,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:04,193 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:04,193 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:04,195 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 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:04,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:04,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:04,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:04,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:04,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:04,221 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:04,221 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:04,227 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 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:04,250 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:34:04,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:04,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:04,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:04,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:04,254 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:04,254 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:04,264 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:34:04,272 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:34:04,272 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:04,274 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:34:04,276 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:34:04,276 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:34:04,276 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 + 100 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 - 2 >= 0] [2020-07-29 01:34:04,560 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2020-07-29 01:34:04,575 INFO L393 LassoCheck]: Loop: "call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100;" "assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100;" "assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54;" [2020-07-29 01:34:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:04,585 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:34:04,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:04,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-29 01:34:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:04,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:04,696 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:34:04,700 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:04,708 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:04,708 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:34:04,709 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:13 [2020-07-29 01:34:04,763 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-29 01:34:04,764 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:04,777 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:04,777 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:34:04,777 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2020-07-29 01:34:04,840 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 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-29 01:34:04,843 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:04,853 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:04,854 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:34:04,854 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2020-07-29 01:34:07,971 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:07,971 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_168|]. (let ((.cse1 (select |v_#memory_int_168| ULTIMATE.start_main_~x~0.base))) (let ((.cse0 (select .cse1 ULTIMATE.start_main_~x~0.offset))) (and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (= 0 (+ .cse0 1)) (= (store |v_#memory_int_168| ULTIMATE.start_main_~x~0.base (store .cse1 ULTIMATE.start_main_~x~0.offset (+ .cse0 (- 1)))) |#memory_int|) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded))) [2020-07-29 01:34:07,971 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2)) (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded) [2020-07-29 01:34:08,040 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 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-29 01:34:08,042 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:08,055 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:08,056 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:34:08,056 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2020-07-29 01:34:11,754 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:11,755 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_169|]. (let ((.cse1 (select |v_#memory_int_169| ULTIMATE.start_main_~x~0.base))) (let ((.cse0 (select .cse1 ULTIMATE.start_main_~x~0.offset))) (and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (= 0 (+ .cse0 2)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (= (store |v_#memory_int_169| ULTIMATE.start_main_~x~0.base (store .cse1 ULTIMATE.start_main_~x~0.offset (+ .cse0 (- 1)))) |#memory_int|) unseeded))) [2020-07-29 01:34:11,755 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3)) (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded) [2020-07-29 01:34:11,827 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 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-29 01:34:11,830 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:11,842 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:11,843 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:34:11,843 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2020-07-29 01:34:15,494 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:15,494 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_170|]. (let ((.cse0 (select |v_#memory_int_170| ULTIMATE.start_main_~x~0.base))) (let ((.cse1 (select .cse0 ULTIMATE.start_main_~x~0.offset))) (and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (= |#memory_int| (store |v_#memory_int_170| ULTIMATE.start_main_~x~0.base (store .cse0 ULTIMATE.start_main_~x~0.offset (+ .cse1 (- 1))))) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (= (+ .cse1 3) 0) unseeded))) [2020-07-29 01:34:15,494 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 4)) unseeded) [2020-07-29 01:34:15,574 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 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-29 01:34:15,578 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:15,591 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:15,591 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:34:15,591 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2020-07-29 01:34:18,440 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:18,440 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_171|]. (let ((.cse1 (select |v_#memory_int_171| ULTIMATE.start_main_~x~0.base))) (let ((.cse0 (select .cse1 ULTIMATE.start_main_~x~0.offset))) (and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (= 0 (+ .cse0 4)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (= (store |v_#memory_int_171| ULTIMATE.start_main_~x~0.base (store .cse1 ULTIMATE.start_main_~x~0.offset (+ .cse0 (- 1)))) |#memory_int|) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded))) [2020-07-29 01:34:18,440 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 5)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded) [2020-07-29 01:34:18,504 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 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-29 01:34:18,514 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:18,527 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:18,527 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:34:18,528 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2020-07-29 01:34:20,694 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:20,694 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_172|]. (let ((.cse1 (select |v_#memory_int_172| ULTIMATE.start_main_~x~0.base))) (let ((.cse0 (select .cse1 ULTIMATE.start_main_~x~0.offset))) (and (= 0 (+ .cse0 5)) (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (= (store |v_#memory_int_172| ULTIMATE.start_main_~x~0.base (store .cse1 ULTIMATE.start_main_~x~0.offset (+ .cse0 (- 1)))) |#memory_int|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded))) [2020-07-29 01:34:20,694 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 6)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded) [2020-07-29 01:34:20,773 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 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-29 01:34:20,778 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:20,792 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:20,792 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:34:20,792 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2020-07-29 01:34:22,998 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:22,999 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_173|]. (let ((.cse1 (select |v_#memory_int_173| ULTIMATE.start_main_~x~0.base))) (let ((.cse0 (select .cse1 ULTIMATE.start_main_~x~0.offset))) (and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (= 0 (+ .cse0 6)) (= |#memory_int| (store |v_#memory_int_173| ULTIMATE.start_main_~x~0.base (store .cse1 ULTIMATE.start_main_~x~0.offset (+ .cse0 (- 1))))) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded))) [2020-07-29 01:34:22,999 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 7)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded) [2020-07-29 01:34:23,087 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 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-29 01:34:23,089 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:23,101 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:23,101 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:34:23,102 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:20 [2020-07-29 01:34:25,117 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:25,117 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_174|]. (let ((.cse0 (select |v_#memory_int_174| ULTIMATE.start_main_~x~0.base))) (let ((.cse1 (select .cse0 ULTIMATE.start_main_~x~0.offset))) (and (= (store |v_#memory_int_174| ULTIMATE.start_main_~x~0.base (store .cse0 ULTIMATE.start_main_~x~0.offset (+ .cse1 (- 1)))) |#memory_int|) (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (= 0 (+ .cse1 7)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded))) [2020-07-29 01:34:25,117 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (= (- 8) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) unseeded) [2020-07-29 01:34:25,172 INFO L280 TraceCheckUtils]: 0: Hoare triple {3414#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3414#unseeded} is VALID [2020-07-29 01:34:25,175 INFO L280 TraceCheckUtils]: 1: Hoare triple {3414#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; {3643#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} is VALID [2020-07-29 01:34:25,177 INFO L280 TraceCheckUtils]: 2: Hoare triple {3643#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); {3647#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} is VALID [2020-07-29 01:34:25,178 INFO L280 TraceCheckUtils]: 3: Hoare triple {3647#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3647#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} is VALID [2020-07-29 01:34:25,180 INFO L280 TraceCheckUtils]: 4: Hoare triple {3647#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; {3654#(and (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2)) (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} is VALID [2020-07-29 01:34:25,182 INFO L280 TraceCheckUtils]: 5: Hoare triple {3654#(and (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2)) (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3654#(and (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2)) (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} is VALID [2020-07-29 01:34:25,183 INFO L280 TraceCheckUtils]: 6: Hoare triple {3654#(and (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2)) (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; {3661#(and (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3)) (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} is VALID [2020-07-29 01:34:25,184 INFO L280 TraceCheckUtils]: 7: Hoare triple {3661#(and (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3)) (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3661#(and (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3)) (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} is VALID [2020-07-29 01:34:25,186 INFO L280 TraceCheckUtils]: 8: Hoare triple {3661#(and (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3)) (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; {3668#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 4)) unseeded)} is VALID [2020-07-29 01:34:25,188 INFO L280 TraceCheckUtils]: 9: Hoare triple {3668#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 4)) unseeded)} call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3668#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 4)) unseeded)} is VALID [2020-07-29 01:34:25,189 INFO L280 TraceCheckUtils]: 10: Hoare triple {3668#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 4)) unseeded)} assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; {3675#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 5)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} is VALID [2020-07-29 01:34:25,191 INFO L280 TraceCheckUtils]: 11: Hoare triple {3675#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 5)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3675#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 5)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} is VALID [2020-07-29 01:34:25,193 INFO L280 TraceCheckUtils]: 12: Hoare triple {3675#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 5)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; {3682#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 6)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} is VALID [2020-07-29 01:34:25,195 INFO L280 TraceCheckUtils]: 13: Hoare triple {3682#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 6)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3682#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 6)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} is VALID [2020-07-29 01:34:25,196 INFO L280 TraceCheckUtils]: 14: Hoare triple {3682#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 6)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; {3689#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 7)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} is VALID [2020-07-29 01:34:25,198 INFO L280 TraceCheckUtils]: 15: Hoare triple {3689#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 7)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3689#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 7)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} is VALID [2020-07-29 01:34:25,200 INFO L280 TraceCheckUtils]: 16: Hoare triple {3689#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 7)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; {3696#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 8)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} is VALID [2020-07-29 01:34:25,201 INFO L280 TraceCheckUtils]: 17: Hoare triple {3696#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 8)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3696#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 8)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} is VALID [2020-07-29 01:34:25,203 INFO L280 TraceCheckUtils]: 18: Hoare triple {3696#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 8)) (not (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc4.base|)) unseeded)} assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; {3631#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (>= (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) (- 2)) 0) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)) unseeded)} is VALID [2020-07-29 01:34:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:25,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:34:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:25,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:25,267 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:25,386 INFO L280 TraceCheckUtils]: 0: Hoare triple {3632#(and (>= oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) 100)) (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (>= (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) (- 2)) 0) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; {3632#(and (>= oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) 100)) (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (>= (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) (- 2)) 0) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} is VALID [2020-07-29 01:34:25,388 INFO L280 TraceCheckUtils]: 1: Hoare triple {3632#(and (>= oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) 100)) (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (>= (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) (- 2)) 0) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; {3706#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0) (or (not |ULTIMATE.start_main_#t~short50|) (<= (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) 99)) (<= 100 (+ (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) oldRank0)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} is VALID [2020-07-29 01:34:25,394 INFO L280 TraceCheckUtils]: 2: Hoare triple {3706#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0) (or (not |ULTIMATE.start_main_#t~short50|) (<= (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) 99)) (<= 100 (+ (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset) oldRank0)) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; {3634#(and (= ULTIMATE.start_main_~z~0.base |ULTIMATE.start_main_#t~malloc4.base|) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)) 100)))) (not (= ULTIMATE.start_main_~y~0.base |ULTIMATE.start_main_#t~malloc4.base|)) (>= (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) (- 2)) 0) (not (= ULTIMATE.start_main_~z~0.base ULTIMATE.start_main_~x~0.base)))} is VALID [2020-07-29 01:34:25,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:25,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 01:34:25,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:25,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:34:25,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:25,466 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2020-07-29 01:34:25,466 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 24 transitions. cyclomatic complexity: 3 Second operand 13 states. [2020-07-29 01:34:26,348 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 24 transitions. cyclomatic complexity: 3. Second operand 13 states. Result 31 states and 37 transitions. Complement of second has 15 states. [2020-07-29 01:34:26,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 10 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:34:26,348 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:26,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. cyclomatic complexity: 3 [2020-07-29 01:34:26,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:26,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:26,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-07-29 01:34:26,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:26,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:26,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:26,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2020-07-29 01:34:26,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:26,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:26,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:26,351 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 24 transitions. cyclomatic complexity: 3 [2020-07-29 01:34:26,351 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:34:26,351 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states. [2020-07-29 01:34:26,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:26,353 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:34:26,353 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 37 transitions. cyclomatic complexity: 8 [2020-07-29 01:34:26,354 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:34:26,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 24 transitions. cyclomatic complexity: 3 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:34:26,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:34:26,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:34:26,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 24 transitions. cyclomatic complexity: 3 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:34:26,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:34:26,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:34:26,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 24 transitions. cyclomatic complexity: 3 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:34:26,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:34:26,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:34:26,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 24 transitions. cyclomatic complexity: 3 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:34:26,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:34:26,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:34:26,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 24 transitions. cyclomatic complexity: 3 Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:34:26,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:34:26,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:34:26,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 24 transitions. cyclomatic complexity: 3 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:34:26,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:34:26,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:34:26,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 24 transitions. cyclomatic complexity: 3 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:34:26,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:34:26,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:34:26,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 24 transitions. cyclomatic complexity: 3 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:34:26,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:34:26,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:34:26,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 24 transitions. cyclomatic complexity: 3 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:34:26,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:34:26,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:34:26,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 24 transitions. cyclomatic complexity: 3 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:34:26,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:34:26,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:34:26,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 24 transitions. cyclomatic complexity: 3 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:34:26,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:34:26,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:34:26,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 24 transitions. cyclomatic complexity: 3 Stem has 23 letters. Loop has 3 letters. [2020-07-29 01:34:26,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 23 letters. Loop has 3 letters. [2020-07-29 01:34:26,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 23 letters. Loop has 3 letters. [2020-07-29 01:34:26,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 24 transitions. cyclomatic complexity: 3 Stem has 24 letters. Loop has 3 letters. [2020-07-29 01:34:26,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 24 letters. Loop has 3 letters. [2020-07-29 01:34:26,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 24 letters. Loop has 3 letters. [2020-07-29 01:34:26,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,371 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:26,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:34:26,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 32 transitions. [2020-07-29 01:34:26,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 32 transitions. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:34:26,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 32 transitions. Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:34:26,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 32 transitions. Stem has 19 letters. Loop has 6 letters. [2020-07-29 01:34:26,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:26,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. cyclomatic complexity: 8 [2020-07-29 01:34:26,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:26,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 25 states and 27 transitions. [2020-07-29 01:34:26,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-07-29 01:34:26,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-07-29 01:34:26,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2020-07-29 01:34:26,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:34:26,376 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-29 01:34:26,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2020-07-29 01:34:26,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2020-07-29 01:34:26,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:26,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 27 transitions. Second operand 22 states. [2020-07-29 01:34:26,377 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 27 transitions. Second operand 22 states. [2020-07-29 01:34:26,377 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 22 states. [2020-07-29 01:34:26,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:26,378 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-29 01:34:26,378 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-29 01:34:26,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:26,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:26,379 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 25 states and 27 transitions. [2020-07-29 01:34:26,379 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 25 states and 27 transitions. [2020-07-29 01:34:26,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:26,380 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-29 01:34:26,380 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-29 01:34:26,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:26,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:26,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:26,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:26,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 01:34:26,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-07-29 01:34:26,382 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-07-29 01:34:26,382 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-07-29 01:34:26,382 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2020-07-29 01:34:26,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 23 transitions. [2020-07-29 01:34:26,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:26,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:26,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:26,384 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:34:26,384 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:34:26,384 INFO L794 eck$LassoCheckResult]: Stem: 3788#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3784#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 3785#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 3786#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3769#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; 3770#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3775#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 3787#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3771#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 3772#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3778#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; 3789#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3773#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 3774#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3781#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; 3790#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3776#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 3777#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3782#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post45;havoc main_#t~mem44; 3783#L598-4 [2020-07-29 01:34:26,385 INFO L796 eck$LassoCheckResult]: Loop: 3783#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 3779#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 3780#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 3783#L598-4 [2020-07-29 01:34:26,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:26,385 INFO L82 PathProgramCache]: Analyzing trace with hash 189283146, now seen corresponding path program 1 times [2020-07-29 01:34:26,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:26,385 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357659357] [2020-07-29 01:34:26,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:26,639 INFO L280 TraceCheckUtils]: 0: Hoare triple {3844#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3844#true} is VALID [2020-07-29 01:34:26,640 INFO L280 TraceCheckUtils]: 1: Hoare triple {3844#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~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 main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; {3844#true} is VALID [2020-07-29 01:34:26,642 INFO L280 TraceCheckUtils]: 2: Hoare triple {3844#true} assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); {3846#(= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1))} is VALID [2020-07-29 01:34:26,644 INFO L280 TraceCheckUtils]: 3: Hoare triple {3846#(= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1))} call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3847#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1) 0)} is VALID [2020-07-29 01:34:26,646 INFO L280 TraceCheckUtils]: 4: Hoare triple {3847#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 1) 0)} assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; {3848#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0)} is VALID [2020-07-29 01:34:26,647 INFO L280 TraceCheckUtils]: 5: Hoare triple {3848#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0)} call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3848#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0)} is VALID [2020-07-29 01:34:26,649 INFO L280 TraceCheckUtils]: 6: Hoare triple {3848#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2) 0)} assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; {3849#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 0)} is VALID [2020-07-29 01:34:26,650 INFO L280 TraceCheckUtils]: 7: Hoare triple {3849#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 0)} call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3849#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 0)} is VALID [2020-07-29 01:34:26,653 INFO L280 TraceCheckUtils]: 8: Hoare triple {3849#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 0)} assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; {3850#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 4) 0)} is VALID [2020-07-29 01:34:26,654 INFO L280 TraceCheckUtils]: 9: Hoare triple {3850#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 4) 0)} call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3850#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 4) 0)} is VALID [2020-07-29 01:34:26,656 INFO L280 TraceCheckUtils]: 10: Hoare triple {3850#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 4) 0)} assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; {3851#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 5) 0)} is VALID [2020-07-29 01:34:26,657 INFO L280 TraceCheckUtils]: 11: Hoare triple {3851#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 5) 0)} call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3851#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 5) 0)} is VALID [2020-07-29 01:34:26,659 INFO L280 TraceCheckUtils]: 12: Hoare triple {3851#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 5) 0)} assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; {3852#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 6) 0)} is VALID [2020-07-29 01:34:26,660 INFO L280 TraceCheckUtils]: 13: Hoare triple {3852#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 6) 0)} call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3852#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 6) 0)} is VALID [2020-07-29 01:34:26,662 INFO L280 TraceCheckUtils]: 14: Hoare triple {3852#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 6) 0)} assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; {3853#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 7) 0)} is VALID [2020-07-29 01:34:26,663 INFO L280 TraceCheckUtils]: 15: Hoare triple {3853#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 7) 0)} call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3853#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 7) 0)} is VALID [2020-07-29 01:34:26,665 INFO L280 TraceCheckUtils]: 16: Hoare triple {3853#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 7) 0)} assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; {3854#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 8) 0)} is VALID [2020-07-29 01:34:26,666 INFO L280 TraceCheckUtils]: 17: Hoare triple {3854#(<= (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 8) 0)} call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); {3855#(<= (+ |ULTIMATE.start_main_#t~mem43| 8) 0)} is VALID [2020-07-29 01:34:26,668 INFO L280 TraceCheckUtils]: 18: Hoare triple {3855#(<= (+ |ULTIMATE.start_main_#t~mem43| 8) 0)} assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post45;havoc main_#t~mem44; {3845#false} is VALID [2020-07-29 01:34:26,670 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:34:26,670 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357659357] [2020-07-29 01:34:26,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:34:26,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-29 01:34:26,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549117303] [2020-07-29 01:34:26,671 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:34:26,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:26,671 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 17 times [2020-07-29 01:34:26,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:26,671 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266827055] [2020-07-29 01:34:26,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:26,680 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:26,688 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:26,690 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:26,958 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-29 01:34:27,081 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-07-29 01:34:27,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:34:27,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-29 01:34:27,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:34:27,083 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. cyclomatic complexity: 2 Second operand 12 states. [2020-07-29 01:34:27,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:27,440 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2020-07-29 01:34:27,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 01:34:27,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-29 01:34:27,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:27,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 18 transitions. [2020-07-29 01:34:27,491 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:34:27,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2020-07-29 01:34:27,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:34:27,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:34:27,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:34:27,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:34:27,492 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:34:27,493 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:34:27,493 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:34:27,493 INFO L424 BuchiCegarLoop]: ======== Iteration 18============ [2020-07-29 01:34:27,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:34:27,493 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:34:27,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:34:27,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:34:27 BoogieIcfgContainer [2020-07-29 01:34:27,501 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:34:27,501 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:34:27,501 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:34:27,502 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:34:27,502 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:33:03" (3/4) ... [2020-07-29 01:34:27,506 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:34:27,506 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:34:27,508 INFO L168 Benchmark]: Toolchain (without parser) took 85504.58 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 442.0 MB). Free memory was 956.2 MB in the beginning and 1.4 GB in the end (delta: -411.8 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:27,509 INFO L168 Benchmark]: CDTParser took 0.30 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:34:27,509 INFO L168 Benchmark]: CACSL2BoogieTranslator took 672.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -115.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:27,509 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:27,509 INFO L168 Benchmark]: Boogie Preprocessor took 51.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:34:27,510 INFO L168 Benchmark]: RCFGBuilder took 774.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:27,510 INFO L168 Benchmark]: BuchiAutomizer took 83927.19 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 354.4 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -355.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:34:27,510 INFO L168 Benchmark]: Witness Printer took 5.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:34:27,517 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 0.30 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 672.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -115.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 774.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 83927.19 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 354.4 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -355.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 5.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 17 terminating modules (15 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y][y] + 100 and consists of 14 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z][z] + 100 and consists of 13 locations. 15 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 83.8s and 18 iterations. TraceHistogramMax:1. Analysis of lassos took 28.9s. Construction of modules took 4.5s. Büchi inclusion checks took 49.8s. Highest rank in rank-based complementation 3. Minimization of det autom 17. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 223 StatesRemovedByMinimization, 15 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 50 states and ocurred in iteration 9. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 250 SDtfs, 521 SDslu, 378 SDs, 0 SdLazy, 2305 SolverSat, 423 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU15 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital348 mio100 ax105 hnf100 lsp90 ukn57 mio100 lsp36 div100 bol100 ite100 ukn100 eq187 hnf88 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...