./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/b.11-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 6d6fa40570ac98fcded670ccb8a913ea07efa9b1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-906a4fb [2020-10-19 18:46:01,500 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 18:46:01,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 18:46:01,533 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 18:46:01,533 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 18:46:01,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 18:46:01,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 18:46:01,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 18:46:01,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 18:46:01,542 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 18:46:01,543 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 18:46:01,544 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 18:46:01,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 18:46:01,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 18:46:01,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 18:46:01,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 18:46:01,550 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 18:46:01,551 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 18:46:01,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 18:46:01,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 18:46:01,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 18:46:01,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 18:46:01,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 18:46:01,562 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 18:46:01,565 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 18:46:01,565 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 18:46:01,566 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 18:46:01,567 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 18:46:01,567 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 18:46:01,568 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 18:46:01,569 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 18:46:01,570 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 18:46:01,571 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 18:46:01,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 18:46:01,573 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 18:46:01,573 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 18:46:01,574 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 18:46:01,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 18:46:01,575 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 18:46:01,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 18:46:01,577 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 18:46:01,578 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-19 18:46:01,614 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 18:46:01,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 18:46:01,616 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 18:46:01,616 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 18:46:01,616 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 18:46:01,616 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 18:46:01,616 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 18:46:01,617 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 18:46:01,617 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 18:46:01,617 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 18:46:01,618 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 18:46:01,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 18:46:01,619 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 18:46:01,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 18:46:01,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 18:46:01,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 18:46:01,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 18:46:01,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 18:46:01,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 18:46:01,621 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 18:46:01,621 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 18:46:01,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 18:46:01,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 18:46:01,622 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 18:46:01,622 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 18:46:01,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 18:46:01,623 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 18:46:01,623 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 18:46:01,623 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 18:46:01,625 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 18:46:01,625 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 -> 6d6fa40570ac98fcded670ccb8a913ea07efa9b1 [2020-10-19 18:46:01,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 18:46:01,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 18:46:01,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 18:46:01,988 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 18:46:01,990 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 18:46:01,991 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i [2020-10-19 18:46:02,070 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d7105298/327265ddc4444204a9573e116df7fa99/FLAGf2e27c22f [2020-10-19 18:46:02,609 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 18:46:02,610 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i [2020-10-19 18:46:02,623 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d7105298/327265ddc4444204a9573e116df7fa99/FLAGf2e27c22f [2020-10-19 18:46:02,920 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d7105298/327265ddc4444204a9573e116df7fa99 [2020-10-19 18:46:02,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 18:46:02,930 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 18:46:02,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 18:46:02,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 18:46:02,935 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 18:46:02,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:46:02" (1/1) ... [2020-10-19 18:46:02,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f247121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:46:02, skipping insertion in model container [2020-10-19 18:46:02,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:46:02" (1/1) ... [2020-10-19 18:46:02,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 18:46:03,003 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 18:46:03,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:46:03,364 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 18:46:03,430 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:46:03,478 INFO L208 MainTranslator]: Completed translation [2020-10-19 18:46:03,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:46:03 WrapperNode [2020-10-19 18:46:03,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 18:46:03,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 18:46:03,480 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 18:46:03,481 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 18:46:03,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:46:03" (1/1) ... [2020-10-19 18:46:03,505 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:46:03" (1/1) ... [2020-10-19 18:46:03,528 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 18:46:03,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 18:46:03,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 18:46:03,529 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 18:46:03,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:46:03" (1/1) ... [2020-10-19 18:46:03,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:46:03" (1/1) ... [2020-10-19 18:46:03,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:46:03" (1/1) ... [2020-10-19 18:46:03,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:46:03" (1/1) ... [2020-10-19 18:46:03,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:46:03" (1/1) ... [2020-10-19 18:46:03,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:46:03" (1/1) ... [2020-10-19 18:46:03,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:46:03" (1/1) ... [2020-10-19 18:46:03,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 18:46:03,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 18:46:03,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 18:46:03,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 18:46:03,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:46:03" (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-10-19 18:46:03,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 18:46:03,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 18:46:03,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 18:46:03,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 18:46:03,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 18:46:03,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 18:46:03,991 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 18:46:03,991 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-19 18:46:03,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:46:03 BoogieIcfgContainer [2020-10-19 18:46:03,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 18:46:03,994 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 18:46:03,994 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 18:46:03,998 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 18:46:03,999 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:46:03,999 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 06:46:02" (1/3) ... [2020-10-19 18:46:04,000 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68ca58b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:46:04, skipping insertion in model container [2020-10-19 18:46:04,000 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:46:04,001 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:46:03" (2/3) ... [2020-10-19 18:46:04,001 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68ca58b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:46:04, skipping insertion in model container [2020-10-19 18:46:04,001 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:46:04,001 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:46:03" (3/3) ... [2020-10-19 18:46:04,003 INFO L373 chiAutomizerObserver]: Analyzing ICFG b.11-alloca.i [2020-10-19 18:46:04,051 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 18:46:04,051 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 18:46:04,052 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 18:46:04,052 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 18:46:04,052 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 18:46:04,052 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 18:46:04,052 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 18:46:04,053 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 18:46:04,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-10-19 18:46:04,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-10-19 18:46:04,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:46:04,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:46:04,103 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:46:04,103 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:46:04,103 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 18:46:04,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-10-19 18:46:04,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-10-19 18:46:04,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:46:04,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:46:04,106 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:46:04,106 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:46:04,114 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 12#L-1true havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 5#L559-2true [2020-10-19 18:46:04,115 INFO L796 eck$LassoCheckResult]: Loop: 5#L559-2true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 10#L555-1true assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 14#L555-3true test_fun_#t~short13 := test_fun_#t~short8; 16#L555-4true assume test_fun_#t~short13; 6#L555-9true test_fun_#t~short16 := test_fun_#t~short13; 8#L555-10true assume !test_fun_#t~short16; 11#L555-12true assume !!test_fun_#t~short16;havoc test_fun_#t~short12;havoc test_fun_#t~mem10;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~short16;havoc test_fun_#t~mem14;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~short13;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 7#L556true assume test_fun_#t~mem17 > test_fun_#t~mem18;havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem19 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem19 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem19; 5#L559-2true [2020-10-19 18:46:04,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:04,121 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-19 18:46:04,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:04,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521995668] [2020-10-19 18:46:04,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:04,262 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:04,293 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:04,317 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:04,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:04,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1790206705, now seen corresponding path program 1 times [2020-10-19 18:46:04,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:04,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356070242] [2020-10-19 18:46:04,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:04,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:46:04,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356070242] [2020-10-19 18:46:04,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:46:04,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 18:46:04,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101835710] [2020-10-19 18:46:04,407 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:46:04,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:46:04,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 18:46:04,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-19 18:46:04,427 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 4 states. [2020-10-19 18:46:04,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:46:04,491 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2020-10-19 18:46:04,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 18:46:04,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2020-10-19 18:46:04,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-10-19 18:46:04,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 22 transitions. [2020-10-19 18:46:04,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-19 18:46:04,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-19 18:46:04,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2020-10-19 18:46:04,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:46:04,503 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-10-19 18:46:04,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2020-10-19 18:46:04,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-10-19 18:46:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-19 18:46:04,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2020-10-19 18:46:04,536 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-10-19 18:46:04,536 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-10-19 18:46:04,536 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 18:46:04,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2020-10-19 18:46:04,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-10-19 18:46:04,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:46:04,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:46:04,538 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:46:04,538 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:46:04,539 INFO L794 eck$LassoCheckResult]: Stem: 62#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 61#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 53#L559-2 [2020-10-19 18:46:04,539 INFO L796 eck$LassoCheckResult]: Loop: 53#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 54#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 60#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 63#L555-4 assume test_fun_#t~short13; 64#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 58#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 59#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~short12;havoc test_fun_#t~mem10;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~short16;havoc test_fun_#t~mem14;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~short13;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 56#L556 assume test_fun_#t~mem17 > test_fun_#t~mem18;havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem19 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem19 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem19; 53#L559-2 [2020-10-19 18:46:04,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:04,539 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-19 18:46:04,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:04,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131560910] [2020-10-19 18:46:04,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:04,565 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:04,599 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:04,612 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:04,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:04,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1790208627, now seen corresponding path program 1 times [2020-10-19 18:46:04,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:04,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666373496] [2020-10-19 18:46:04,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:04,629 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:04,643 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:04,647 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:04,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:04,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1099647153, now seen corresponding path program 1 times [2020-10-19 18:46:04,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:04,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108398113] [2020-10-19 18:46:04,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:04,689 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:04,751 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:04,767 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:05,020 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2020-10-19 18:46:05,493 WARN L193 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2020-10-19 18:46:05,652 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-19 18:46:05,667 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:46:05,668 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:46:05,668 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:46:05,668 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:46:05,669 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:46:05,669 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:05,669 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:46:05,669 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:46:05,670 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.11-alloca.i_Iteration2_Lasso [2020-10-19 18:46:05,670 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:46:05,670 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:46:05,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:05,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,055 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2020-10-19 18:46:06,165 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-10-19 18:46:06,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:06,853 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:46:06,859 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) [2020-10-19 18:46:06,869 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-10-19 18:46:06,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:06,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:06,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:06,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:06,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:06,876 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:06,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:06,880 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-10-19 18:46:06,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 [2020-10-19 18:46:06,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:06,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:06,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:06,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:06,937 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:06,938 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:06,953 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:46:06,994 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-10-19 18:46:06,995 INFO L444 ModelExtractionUtils]: 9 out of 28 variables were initially zero. Simplification set additionally 17 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:46:07,008 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:07,040 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 18:46:07,041 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:46:07,041 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2020-10-19 18:46:07,185 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2020-10-19 18:46:07,192 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-19 18:46:07,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:07,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 18:46:07,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:46:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:07,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 18:46:07,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:46:07,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:46:07,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:46:07,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:46:07,404 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-19 18:46:07,405 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 7 Second operand 5 states. [2020-10-19 18:46:07,549 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 31 states and 45 transitions. Complement of second has 8 states. [2020-10-19 18:46:07,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-19 18:46:07,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-19 18:46:07,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2020-10-19 18:46:07,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2020-10-19 18:46:07,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:46:07,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2020-10-19 18:46:07,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:46:07,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2020-10-19 18:46:07,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:46:07,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 45 transitions. [2020-10-19 18:46:07,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-10-19 18:46:07,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 45 transitions. [2020-10-19 18:46:07,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-19 18:46:07,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-19 18:46:07,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 45 transitions. [2020-10-19 18:46:07,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:46:07,572 INFO L691 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-10-19 18:46:07,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 45 transitions. [2020-10-19 18:46:07,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2020-10-19 18:46:07,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-19 18:46:07,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2020-10-19 18:46:07,579 INFO L714 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2020-10-19 18:46:07,579 INFO L594 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2020-10-19 18:46:07,579 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 18:46:07,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 43 transitions. [2020-10-19 18:46:07,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-10-19 18:46:07,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:46:07,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:46:07,584 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-19 18:46:07,584 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:46:07,589 INFO L794 eck$LassoCheckResult]: Stem: 258#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 256#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 257#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 240#L555-1 [2020-10-19 18:46:07,589 INFO L796 eck$LassoCheckResult]: Loop: 240#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 254#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 259#L555-4 assume test_fun_#t~short13; 243#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 244#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 251#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~short12;havoc test_fun_#t~mem10;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~short16;havoc test_fun_#t~mem14;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~short13;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 246#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 247#L559 assume !(test_fun_#t~mem20 == test_fun_#t~mem21);havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem23 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23; 239#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 240#L555-1 [2020-10-19 18:46:07,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:07,590 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2020-10-19 18:46:07,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:07,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605775751] [2020-10-19 18:46:07,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:07,638 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:07,668 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:07,672 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:07,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:07,673 INFO L82 PathProgramCache]: Analyzing trace with hash 572463690, now seen corresponding path program 1 times [2020-10-19 18:46:07,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:07,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830250511] [2020-10-19 18:46:07,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:07,687 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:07,700 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:07,703 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:07,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:07,704 INFO L82 PathProgramCache]: Analyzing trace with hash -198955769, now seen corresponding path program 1 times [2020-10-19 18:46:07,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:07,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831915473] [2020-10-19 18:46:07,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:07,728 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:07,749 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:07,755 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:07,996 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2020-10-19 18:46:08,478 WARN L193 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2020-10-19 18:46:08,664 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-19 18:46:08,668 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:46:08,669 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:46:08,669 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:46:08,669 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:46:08,669 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:46:08,669 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:08,669 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:46:08,670 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:46:08,670 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.11-alloca.i_Iteration3_Lasso [2020-10-19 18:46:08,670 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:46:08,670 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:46:08,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:08,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:08,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:08,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:08,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:08,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:08,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:08,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:08,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:08,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:08,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:08,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:08,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:08,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:08,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:08,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:08,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:08,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:08,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:08,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:08,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:09,518 WARN L193 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2020-10-19 18:46:09,685 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2020-10-19 18:46:09,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:09,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:09,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:09,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:09,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:09,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:09,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:10,494 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2020-10-19 18:46:10,639 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2020-10-19 18:46:10,688 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:46:10,689 INFO L489 LassoAnalysis]: Using template 'affine'. 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-10-19 18:46:10,697 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-10-19 18:46:10,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:10,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:10,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:10,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:10,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:10,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:10,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:10,703 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-10-19 18:46:10,728 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-10-19 18:46:10,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:10,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:10,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:10,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:10,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:10,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:10,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:10,733 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:10,759 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-10-19 18:46:10,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:10,760 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:10,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:10,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:10,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:10,761 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:10,761 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:10,762 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:10,785 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-10-19 18:46:10,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:10,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:10,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:10,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:10,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:10,787 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:10,787 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:10,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 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-10-19 18:46:10,817 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-10-19 18:46:10,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:10,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:10,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:10,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:10,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:10,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:10,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:10,824 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-10-19 18:46:10,870 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-10-19 18:46:10,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:10,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:10,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:10,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:10,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:10,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:10,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:10,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-19 18:46:10,917 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-10-19 18:46:10,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:10,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:10,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:10,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:10,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:10,920 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:10,920 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:10,922 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-10-19 18:46:10,960 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-10-19 18:46:10,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:10,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:10,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:10,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:10,964 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:10,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:46:10,968 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) [2020-10-19 18:46:11,010 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-10-19 18:46:11,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:11,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:11,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:11,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:11,014 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:11,014 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:11,018 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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:11,046 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-10-19 18:46:11,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:11,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:11,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:11,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:11,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:11,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:11,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:11,050 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-10-19 18:46:11,071 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-10-19 18:46:11,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:11,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:11,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:11,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:11,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:11,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:11,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:11,075 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) [2020-10-19 18:46:11,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:11,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:11,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:11,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:11,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:11,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:11,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:11,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:11,102 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-19 18:46:11,131 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-10-19 18:46:11,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:11,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:11,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:11,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:11,135 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:11,135 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:46:11,137 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-10-19 18:46:11,163 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-10-19 18:46:11,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:11,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:11,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:11,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:11,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:11,165 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:11,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:11,166 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-10-19 18:46:11,188 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-10-19 18:46:11,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:11,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:11,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:11,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:11,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:11,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:11,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:11,193 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) [2020-10-19 18:46:11,218 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:11,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:11,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:11,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:11,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:11,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:11,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:11,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:11,222 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-10-19 18:46:11,253 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-10-19 18:46:11,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:11,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:11,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:11,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:11,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:11,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:11,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:11,256 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) [2020-10-19 18:46:11,279 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:11,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:11,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:11,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:11,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:11,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:11,282 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:46:11,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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:46:11,323 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-10-19 18:46:11,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:11,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:11,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:11,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:11,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:11,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:11,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:11,333 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-10-19 18:46:11,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:46:11,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:11,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:11,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:11,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:11,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:11,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:11,360 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:11,361 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-10-19 18:46:11,386 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-10-19 18:46:11,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:11,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:11,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:11,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:11,395 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:11,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:46:11,413 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:46:11,450 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-10-19 18:46:11,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:11,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:11,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:11,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:11,453 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:11,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:11,464 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-10-19 18:46:11,490 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-10-19 18:46:11,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:11,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:11,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:11,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:11,496 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:11,496 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:46:11,502 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-10-19 18:46:11,529 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-10-19 18:46:11,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:11,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:11,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:11,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:11,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:11,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:46:11,537 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-10-19 18:46:11,560 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-10-19 18:46:11,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:11,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:11,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:11,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:11,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:11,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:46:11,572 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:46:11,595 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:11,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:11,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:11,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:11,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:11,598 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:11,598 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:46:11,602 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-10-19 18:46:11,629 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-10-19 18:46:11,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:11,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:11,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:11,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:11,633 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:11,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:46:11,639 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-10-19 18:46:11,666 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-10-19 18:46:11,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:11,668 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-19 18:46:11,668 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-19 18:46:11,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:11,691 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2020-10-19 18:46:11,691 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-10-19 18:46:11,750 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:46:11,809 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-19 18:46:11,809 INFO L444 ModelExtractionUtils]: 40 out of 56 variables were initially zero. Simplification set additionally 14 variables to zero. 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-10-19 18:46:11,811 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 18:46:11,815 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2020-10-19 18:46:11,815 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:46:11,816 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2020-10-19 18:46:11,915 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2020-10-19 18:46:11,916 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-19 18:46:11,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:11,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 18:46:11,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:46:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:11,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 18:46:11,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:46:11,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:46:11,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:46:12,145 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:46:12,146 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 66 [2020-10-19 18:46:12,150 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-19 18:46:12,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 18:46:12,156 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:46:12,198 INFO L625 ElimStorePlain]: treesize reduction 130, result has 21.7 percent of original size [2020-10-19 18:46:12,200 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-19 18:46:12,201 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:36 [2020-10-19 18:46:12,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:46:12,231 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-10-19 18:46:12,231 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 43 transitions. cyclomatic complexity: 15 Second operand 7 states. [2020-10-19 18:46:12,397 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 43 transitions. cyclomatic complexity: 15. Second operand 7 states. Result 64 states and 97 transitions. Complement of second has 10 states. [2020-10-19 18:46:12,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-10-19 18:46:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-19 18:46:12,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2020-10-19 18:46:12,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 3 letters. Loop has 9 letters. [2020-10-19 18:46:12,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:46:12,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 12 letters. Loop has 9 letters. [2020-10-19 18:46:12,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:46:12,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 3 letters. Loop has 18 letters. [2020-10-19 18:46:12,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:46:12,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 97 transitions. [2020-10-19 18:46:12,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-10-19 18:46:12,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 97 transitions. [2020-10-19 18:46:12,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-19 18:46:12,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-10-19 18:46:12,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 97 transitions. [2020-10-19 18:46:12,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:46:12,406 INFO L691 BuchiCegarLoop]: Abstraction has 64 states and 97 transitions. [2020-10-19 18:46:12,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 97 transitions. [2020-10-19 18:46:12,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2020-10-19 18:46:12,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-19 18:46:12,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 94 transitions. [2020-10-19 18:46:12,413 INFO L714 BuchiCegarLoop]: Abstraction has 62 states and 94 transitions. [2020-10-19 18:46:12,413 INFO L594 BuchiCegarLoop]: Abstraction has 62 states and 94 transitions. [2020-10-19 18:46:12,413 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 18:46:12,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 94 transitions. [2020-10-19 18:46:12,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-10-19 18:46:12,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:46:12,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:46:12,416 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 18:46:12,416 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:46:12,416 INFO L794 eck$LassoCheckResult]: Stem: 503#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 501#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 502#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 540#L555-1 assume !test_fun_#t~short8; 504#L555-3 [2020-10-19 18:46:12,416 INFO L796 eck$LassoCheckResult]: Loop: 504#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 505#L555-4 assume test_fun_#t~short13; 507#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 495#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 496#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~short12;havoc test_fun_#t~mem10;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~short16;havoc test_fun_#t~mem14;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~short13;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 490#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 491#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 483#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 484#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 504#L555-3 [2020-10-19 18:46:12,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:12,417 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2020-10-19 18:46:12,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:12,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475989049] [2020-10-19 18:46:12,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:12,432 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:12,444 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:12,448 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:12,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:12,448 INFO L82 PathProgramCache]: Analyzing trace with hash -162891098, now seen corresponding path program 1 times [2020-10-19 18:46:12,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:12,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590207946] [2020-10-19 18:46:12,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:12,462 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:12,472 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:12,475 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:12,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:12,475 INFO L82 PathProgramCache]: Analyzing trace with hash 2029276831, now seen corresponding path program 1 times [2020-10-19 18:46:12,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:12,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148454845] [2020-10-19 18:46:12,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:12,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:46:12,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148454845] [2020-10-19 18:46:12,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:46:12,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 18:46:12,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059920884] [2020-10-19 18:46:12,764 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2020-10-19 18:46:12,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:46:12,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 18:46:12,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-19 18:46:12,824 INFO L87 Difference]: Start difference. First operand 62 states and 94 transitions. cyclomatic complexity: 36 Second operand 4 states. [2020-10-19 18:46:12,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:46:12,859 INFO L93 Difference]: Finished difference Result 90 states and 130 transitions. [2020-10-19 18:46:12,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 18:46:12,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 130 transitions. [2020-10-19 18:46:12,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2020-10-19 18:46:12,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 130 transitions. [2020-10-19 18:46:12,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-10-19 18:46:12,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-10-19 18:46:12,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 130 transitions. [2020-10-19 18:46:12,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:46:12,864 INFO L691 BuchiCegarLoop]: Abstraction has 90 states and 130 transitions. [2020-10-19 18:46:12,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 130 transitions. [2020-10-19 18:46:12,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2020-10-19 18:46:12,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-19 18:46:12,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions. [2020-10-19 18:46:12,871 INFO L714 BuchiCegarLoop]: Abstraction has 70 states and 102 transitions. [2020-10-19 18:46:12,871 INFO L594 BuchiCegarLoop]: Abstraction has 70 states and 102 transitions. [2020-10-19 18:46:12,871 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 18:46:12,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 102 transitions. [2020-10-19 18:46:12,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-10-19 18:46:12,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:46:12,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:46:12,873 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 18:46:12,873 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:46:12,874 INFO L794 eck$LassoCheckResult]: Stem: 668#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 666#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 667#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 698#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 669#L555-3 [2020-10-19 18:46:12,874 INFO L796 eck$LassoCheckResult]: Loop: 669#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 670#L555-4 assume test_fun_#t~short13; 650#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 651#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 657#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~short12;havoc test_fun_#t~mem10;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~short16;havoc test_fun_#t~mem14;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~short13;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 653#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 654#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 646#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 647#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 669#L555-3 [2020-10-19 18:46:12,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:12,874 INFO L82 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2020-10-19 18:46:12,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:12,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583081925] [2020-10-19 18:46:12,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:12,886 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:12,895 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:12,899 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:12,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:12,900 INFO L82 PathProgramCache]: Analyzing trace with hash -162891098, now seen corresponding path program 2 times [2020-10-19 18:46:12,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:12,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951867045] [2020-10-19 18:46:12,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:12,911 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:12,920 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:12,923 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:12,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:12,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1872663455, now seen corresponding path program 1 times [2020-10-19 18:46:12,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:12,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219403693] [2020-10-19 18:46:12,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:12,940 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:12,957 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:12,962 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:13,184 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2020-10-19 18:46:13,744 WARN L193 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 107 [2020-10-19 18:46:13,928 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-19 18:46:13,932 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:46:13,932 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:46:13,932 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:46:13,932 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:46:13,932 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:46:13,933 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:13,933 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:46:13,933 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:46:13,933 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.11-alloca.i_Iteration5_Lasso [2020-10-19 18:46:13,933 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:46:13,933 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:46:13,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-10-19 18:46:14,869 WARN L193 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2020-10-19 18:46:15,063 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2020-10-19 18:46:15,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:15,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:15,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:15,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:15,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:15,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:15,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:15,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-10-19 18:46:15,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:15,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:15,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:15,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:15,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:15,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:15,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:15,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-10-19 18:46:15,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:15,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-10-19 18:46:15,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:15,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-10-19 18:46:15,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:15,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:15,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:15,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-10-19 18:46:15,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:15,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:46:15,309 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2020-10-19 18:46:15,949 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-10-19 18:46:16,164 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2020-10-19 18:46:16,340 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:46:16,340 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-10-19 18:46:16,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-10-19 18:46:16,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:16,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:16,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:16,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:16,360 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:16,360 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:16,364 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-10-19 18:46:16,392 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-10-19 18:46:16,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:16,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:16,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:16,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:16,395 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:16,395 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:46:16,402 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-10-19 18:46:16,424 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-10-19 18:46:16,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:16,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:16,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:16,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:16,428 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:16,428 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:46:16,433 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-10-19 18:46:16,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:46:16,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:16,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:16,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:16,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:16,458 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:16,458 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:46:16,461 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-10-19 18:46:16,483 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-10-19 18:46:16,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:16,485 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-19 18:46:16,486 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-19 18:46:16,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:16,517 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2020-10-19 18:46:16,518 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-10-19 18:46:16,619 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:46:16,693 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-10-19 18:46:16,694 INFO L444 ModelExtractionUtils]: 58 out of 66 variables were initially zero. Simplification set additionally 6 variables to zero. 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) [2020-10-19 18:46:16,697 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:16,702 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2020-10-19 18:46:16,702 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:46:16,702 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2020-10-19 18:46:16,827 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2020-10-19 18:46:16,828 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-19 18:46:16,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:16,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 18:46:16,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:46:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:16,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 18:46:16,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:46:16,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:46:16,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:46:16,996 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:46:16,997 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 66 [2020-10-19 18:46:17,001 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-19 18:46:17,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 18:46:17,006 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:46:17,056 INFO L625 ElimStorePlain]: treesize reduction 130, result has 21.7 percent of original size [2020-10-19 18:46:17,057 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-19 18:46:17,057 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:36 [2020-10-19 18:46:17,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:46:17,087 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-10-19 18:46:17,087 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 102 transitions. cyclomatic complexity: 36 Second operand 7 states. [2020-10-19 18:46:17,245 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 102 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 204 states and 297 transitions. Complement of second has 10 states. [2020-10-19 18:46:17,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-10-19 18:46:17,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-19 18:46:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2020-10-19 18:46:17,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 4 letters. Loop has 9 letters. [2020-10-19 18:46:17,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:46:17,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 13 letters. Loop has 9 letters. [2020-10-19 18:46:17,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:46:17,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 4 letters. Loop has 18 letters. [2020-10-19 18:46:17,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:46:17,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 204 states and 297 transitions. [2020-10-19 18:46:17,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-10-19 18:46:17,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 204 states to 54 states and 73 transitions. [2020-10-19 18:46:17,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-19 18:46:17,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-19 18:46:17,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 73 transitions. [2020-10-19 18:46:17,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:46:17,254 INFO L691 BuchiCegarLoop]: Abstraction has 54 states and 73 transitions. [2020-10-19 18:46:17,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 73 transitions. [2020-10-19 18:46:17,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-10-19 18:46:17,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-19 18:46:17,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2020-10-19 18:46:17,259 INFO L714 BuchiCegarLoop]: Abstraction has 54 states and 73 transitions. [2020-10-19 18:46:17,259 INFO L594 BuchiCegarLoop]: Abstraction has 54 states and 73 transitions. [2020-10-19 18:46:17,259 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 18:46:17,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 73 transitions. [2020-10-19 18:46:17,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-10-19 18:46:17,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:46:17,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:46:17,261 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 18:46:17,261 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:46:17,261 INFO L794 eck$LassoCheckResult]: Stem: 1105#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1103#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1104#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1132#L555-1 assume !test_fun_#t~short8; 1106#L555-3 [2020-10-19 18:46:17,262 INFO L796 eck$LassoCheckResult]: Loop: 1106#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 1107#L555-4 assume !test_fun_#t~short13;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem9 < 0; 1110#L555-6 assume test_fun_#t~short12;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem11 > -2147483648 - test_fun_#t~mem10; 1080#L555-8 test_fun_#t~short13 := test_fun_#t~short12; 1081#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 1088#L555-10 assume !test_fun_#t~short16; 1095#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~short12;havoc test_fun_#t~mem10;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~short16;havoc test_fun_#t~mem14;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~short13;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1090#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1091#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 1084#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1085#L555-1 assume !test_fun_#t~short8; 1106#L555-3 [2020-10-19 18:46:17,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:17,262 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2020-10-19 18:46:17,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:17,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195265202] [2020-10-19 18:46:17,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:17,272 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:17,280 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:17,284 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:17,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:17,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1675651104, now seen corresponding path program 1 times [2020-10-19 18:46:17,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:17,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491970561] [2020-10-19 18:46:17,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:17,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:46:17,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491970561] [2020-10-19 18:46:17,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:46:17,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:46:17,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261776585] [2020-10-19 18:46:17,307 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:46:17,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:46:17,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:46:17,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:46:17,308 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. cyclomatic complexity: 23 Second operand 3 states. [2020-10-19 18:46:17,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:46:17,319 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2020-10-19 18:46:17,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:46:17,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 73 transitions. [2020-10-19 18:46:17,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-10-19 18:46:17,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 54 states and 69 transitions. [2020-10-19 18:46:17,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-19 18:46:17,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-19 18:46:17,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 69 transitions. [2020-10-19 18:46:17,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:46:17,322 INFO L691 BuchiCegarLoop]: Abstraction has 54 states and 69 transitions. [2020-10-19 18:46:17,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 69 transitions. [2020-10-19 18:46:17,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-10-19 18:46:17,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-19 18:46:17,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2020-10-19 18:46:17,326 INFO L714 BuchiCegarLoop]: Abstraction has 54 states and 69 transitions. [2020-10-19 18:46:17,327 INFO L594 BuchiCegarLoop]: Abstraction has 54 states and 69 transitions. [2020-10-19 18:46:17,327 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 18:46:17,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 69 transitions. [2020-10-19 18:46:17,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-10-19 18:46:17,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:46:17,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:46:17,328 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 18:46:17,329 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:46:17,329 INFO L794 eck$LassoCheckResult]: Stem: 1223#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1222#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1202#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1203#L555-1 assume !test_fun_#t~short8; 1224#L555-3 [2020-10-19 18:46:17,329 INFO L796 eck$LassoCheckResult]: Loop: 1224#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 1225#L555-4 assume !test_fun_#t~short13;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem9 < 0; 1228#L555-6 assume test_fun_#t~short12;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem11 > -2147483648 - test_fun_#t~mem10; 1198#L555-8 test_fun_#t~short13 := test_fun_#t~short12; 1199#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 1207#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 1214#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~short12;havoc test_fun_#t~mem10;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~short16;havoc test_fun_#t~mem14;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~short13;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1209#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1210#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 1231#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1234#L555-1 assume !test_fun_#t~short8; 1224#L555-3 [2020-10-19 18:46:17,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:17,330 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 3 times [2020-10-19 18:46:17,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:17,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403233916] [2020-10-19 18:46:17,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:17,339 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:17,348 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:17,351 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:17,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:17,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1732909406, now seen corresponding path program 1 times [2020-10-19 18:46:17,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:17,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021844924] [2020-10-19 18:46:17,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:17,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:46:17,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021844924] [2020-10-19 18:46:17,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:46:17,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-19 18:46:17,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555459291] [2020-10-19 18:46:17,420 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:46:17,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:46:17,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-19 18:46:17,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-19 18:46:17,420 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. cyclomatic complexity: 19 Second operand 7 states. [2020-10-19 18:46:17,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:46:17,538 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2020-10-19 18:46:17,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 18:46:17,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 93 transitions. [2020-10-19 18:46:17,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-10-19 18:46:17,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 71 states and 86 transitions. [2020-10-19 18:46:17,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-19 18:46:17,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-19 18:46:17,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 86 transitions. [2020-10-19 18:46:17,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:46:17,541 INFO L691 BuchiCegarLoop]: Abstraction has 71 states and 86 transitions. [2020-10-19 18:46:17,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 86 transitions. [2020-10-19 18:46:17,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-10-19 18:46:17,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-19 18:46:17,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2020-10-19 18:46:17,547 INFO L714 BuchiCegarLoop]: Abstraction has 71 states and 86 transitions. [2020-10-19 18:46:17,547 INFO L594 BuchiCegarLoop]: Abstraction has 71 states and 86 transitions. [2020-10-19 18:46:17,548 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 18:46:17,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 86 transitions. [2020-10-19 18:46:17,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-10-19 18:46:17,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:46:17,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:46:17,549 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 18:46:17,549 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:46:17,550 INFO L794 eck$LassoCheckResult]: Stem: 1367#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1365#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1366#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1402#L555-1 assume !test_fun_#t~short8; 1368#L555-3 [2020-10-19 18:46:17,550 INFO L796 eck$LassoCheckResult]: Loop: 1368#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 1369#L555-4 assume !test_fun_#t~short13;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem9 < 0; 1371#L555-6 assume !test_fun_#t~short12; 1346#L555-8 test_fun_#t~short13 := test_fun_#t~short12; 1347#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 1354#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 1360#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~short12;havoc test_fun_#t~mem10;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~short16;havoc test_fun_#t~mem14;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~short13;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1356#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1357#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 1350#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1351#L555-1 assume !test_fun_#t~short8; 1368#L555-3 [2020-10-19 18:46:17,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:17,550 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 4 times [2020-10-19 18:46:17,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:17,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830506173] [2020-10-19 18:46:17,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:17,559 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:17,567 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:17,570 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:17,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:17,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1052851036, now seen corresponding path program 1 times [2020-10-19 18:46:17,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:17,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134464338] [2020-10-19 18:46:17,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:17,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:46:17,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134464338] [2020-10-19 18:46:17,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:46:17,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 18:46:17,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031860968] [2020-10-19 18:46:17,595 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:46:17,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:46:17,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 18:46:17,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-19 18:46:17,596 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. cyclomatic complexity: 19 Second operand 5 states. [2020-10-19 18:46:17,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:46:17,633 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2020-10-19 18:46:17,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 18:46:17,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 62 transitions. [2020-10-19 18:46:17,634 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 18:46:17,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 0 states and 0 transitions. [2020-10-19 18:46:17,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-19 18:46:17,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-19 18:46:17,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-19 18:46:17,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:46:17,635 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 18:46:17,635 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 18:46:17,635 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 18:46:17,635 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 18:46:17,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-19 18:46:17,636 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 18:46:17,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-19 18:46:17,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 06:46:17 BoogieIcfgContainer [2020-10-19 18:46:17,643 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 18:46:17,644 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 18:46:17,644 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 18:46:17,644 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 18:46:17,645 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:46:03" (3/4) ... [2020-10-19 18:46:17,649 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-19 18:46:17,649 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 18:46:17,651 INFO L168 Benchmark]: Toolchain (without parser) took 14725.13 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 382.7 MB). Free memory was 954.6 MB in the beginning and 1.1 GB in the end (delta: -106.2 MB). Peak memory consumption was 276.5 MB. Max. memory is 11.5 GB. [2020-10-19 18:46:17,651 INFO L168 Benchmark]: CDTParser took 1.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:46:17,652 INFO L168 Benchmark]: CACSL2BoogieTranslator took 548.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 949.2 MB in the beginning and 1.1 GB in the end (delta: -164.3 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2020-10-19 18:46:17,652 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:46:17,653 INFO L168 Benchmark]: Boogie Preprocessor took 29.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2020-10-19 18:46:17,654 INFO L168 Benchmark]: RCFGBuilder took 434.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2020-10-19 18:46:17,654 INFO L168 Benchmark]: BuchiAutomizer took 13649.60 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 251.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 272.2 MB. Max. memory is 11.5 GB. [2020-10-19 18:46:17,655 INFO L168 Benchmark]: Witness Printer took 5.47 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:46:17,658 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 548.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 949.2 MB in the beginning and 1.1 GB in the end (delta: -164.3 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 434.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13649.60 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 251.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 272.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.47 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 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 - 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 8 terminating modules (5 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. 5 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.6s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 11.8s. Construction of modules took 0.3s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 24 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 71 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 132 SDtfs, 82 SDslu, 179 SDs, 0 SdLazy, 214 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital318 mio100 ax105 hnf99 lsp94 ukn80 mio100 lsp30 div100 bol107 ite100 ukn100 eq162 hnf90 smp92 dnf263 smp65 tf100 neg99 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 150ms VariablesStem: 10 VariablesLoop: 7 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...