./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/b.13-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: 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 /storage/repos/svcomp/c/termination-memory-alloca/b.13-alloca_true-termination_true-no-overflow.c.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 72925b65ef321f719f00e79529e35268c3f3eaa3 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:47:51,540 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:47:51,542 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:47:51,555 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:47:51,555 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:47:51,557 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:47:51,559 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:47:51,570 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:47:51,572 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:47:51,573 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:47:51,574 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:47:51,574 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:47:51,579 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:47:51,583 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:47:51,585 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:47:51,586 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:47:51,587 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:47:51,588 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:47:51,596 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:47:51,599 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:47:51,601 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:47:51,605 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:47:51,607 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:47:51,607 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:47:51,608 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:47:51,609 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:47:51,609 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:47:51,610 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:47:51,611 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:47:51,612 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:47:51,612 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:47:51,613 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:47:51,613 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:47:51,613 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:47:51,614 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:47:51,614 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:47:51,615 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:47:51,631 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:47:51,631 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:47:51,632 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:47:51,633 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:47:51,635 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:47:51,635 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:47:51,635 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:47:51,635 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:47:51,636 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:47:51,636 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:47:51,636 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:47:51,636 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:47:51,636 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:47:51,637 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:47:51,637 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:47:51,637 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:47:51,637 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:47:51,637 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:47:51,637 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:47:51,638 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:47:51,638 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:47:51,638 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:47:51,638 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:47:51,638 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:47:51,638 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:47:51,642 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:47:51,642 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:47:51,642 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:47:51,643 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:47:51,643 INFO L133 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 -> 72925b65ef321f719f00e79529e35268c3f3eaa3 [2019-01-01 21:47:51,704 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:47:51,721 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:47:51,727 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:47:51,729 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:47:51,731 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:47:51,732 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/b.13-alloca_true-termination_true-no-overflow.c.i [2019-01-01 21:47:51,809 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbd380bf0/5f5df2cec71b42f0970e44a419a2287a/FLAGce4ddb9f6 [2019-01-01 21:47:52,308 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:47:52,311 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/b.13-alloca_true-termination_true-no-overflow.c.i [2019-01-01 21:47:52,329 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbd380bf0/5f5df2cec71b42f0970e44a419a2287a/FLAGce4ddb9f6 [2019-01-01 21:47:52,605 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbd380bf0/5f5df2cec71b42f0970e44a419a2287a [2019-01-01 21:47:52,611 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:47:52,613 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:47:52,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:47:52,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:47:52,618 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:47:52,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:47:52" (1/1) ... [2019-01-01 21:47:52,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71849c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:52, skipping insertion in model container [2019-01-01 21:47:52,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:47:52" (1/1) ... [2019-01-01 21:47:52,632 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:47:52,687 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:47:53,024 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:47:53,037 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:47:53,175 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:47:53,225 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:47:53,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:53 WrapperNode [2019-01-01 21:47:53,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:47:53,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:47:53,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:47:53,227 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:47:53,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:53" (1/1) ... [2019-01-01 21:47:53,255 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:53" (1/1) ... [2019-01-01 21:47:53,280 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:47:53,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:47:53,281 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:47:53,281 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:47:53,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:53" (1/1) ... [2019-01-01 21:47:53,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:53" (1/1) ... [2019-01-01 21:47:53,293 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:53" (1/1) ... [2019-01-01 21:47:53,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:53" (1/1) ... [2019-01-01 21:47:53,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:53" (1/1) ... [2019-01-01 21:47:53,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:53" (1/1) ... [2019-01-01 21:47:53,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:53" (1/1) ... [2019-01-01 21:47:53,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:47:53,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:47:53,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:47:53,310 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:47:53,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:47:53,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:47:53,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:47:53,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:47:53,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:47:53,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:47:53,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:47:53,788 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:47:53,788 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-01 21:47:53,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:47:53 BoogieIcfgContainer [2019-01-01 21:47:53,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:47:53,790 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:47:53,790 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:47:53,794 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:47:53,795 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:47:53,795 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:47:52" (1/3) ... [2019-01-01 21:47:53,796 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c88d7ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:47:53, skipping insertion in model container [2019-01-01 21:47:53,797 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:47:53,797 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:53" (2/3) ... [2019-01-01 21:47:53,797 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c88d7ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:47:53, skipping insertion in model container [2019-01-01 21:47:53,797 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:47:53,797 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:47:53" (3/3) ... [2019-01-01 21:47:53,799 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.13-alloca_true-termination_true-no-overflow.c.i [2019-01-01 21:47:53,861 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:47:53,862 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:47:53,862 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:47:53,862 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:47:53,863 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:47:53,863 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:47:53,863 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:47:53,863 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:47:53,863 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:47:53,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-01 21:47:53,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:47:53,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:53,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:53,916 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:47:53,916 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:47:53,916 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:47:53,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-01 21:47:53,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:47:53,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:53,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:53,919 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:47:53,919 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:47:53,926 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 14#L561-2true [2019-01-01 21:47:53,927 INFO L796 eck$LassoCheckResult]: Loop: 14#L561-2true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 8#L557-1true assume test_fun_#t~short10; 12#L557-3true assume !!test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 4#L558true assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; 14#L561-2true [2019-01-01 21:47:53,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:53,933 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 21:47:53,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:53,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:53,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:53,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:53,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:54,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:54,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 1 times [2019-01-01 21:47:54,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:54,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:54,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:54,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:54,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:54,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:54,196 INFO L82 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2019-01-01 21:47:54,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:54,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:54,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:54,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:54,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:54,769 WARN L181 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-01 21:47:56,053 WARN L181 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 128 DAG size of output: 113 [2019-01-01 21:47:56,418 WARN L181 SmtUtils]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-01-01 21:47:56,431 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:47:56,432 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:47:56,432 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:47:56,433 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:47:56,433 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:47:56,433 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:47:56,433 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:47:56,433 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:47:56,434 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.13-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2019-01-01 21:47:56,434 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:47:56,434 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:47:56,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:56,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:56,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:56,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:56,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:56,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:56,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:56,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:56,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:56,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:56,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:56,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:56,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:56,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:56,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:56,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:56,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:57,593 WARN L181 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 98 [2019-01-01 21:47:57,804 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-01-01 21:47:57,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:57,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:57,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:57,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:57,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:58,247 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 21:47:58,400 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-01-01 21:48:00,132 WARN L181 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-01-01 21:48:00,298 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:48:00,305 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:48:00,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:00,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:00,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:00,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:00,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:00,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:00,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:00,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:00,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:00,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:00,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:00,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:00,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:00,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:00,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:00,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:00,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:00,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:00,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:00,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:00,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:00,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:00,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:00,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:00,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:00,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:00,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:00,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:00,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:00,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:00,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:00,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:00,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:00,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:00,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:00,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:00,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:00,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:00,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:00,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:00,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:00,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:00,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:00,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:00,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:00,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:00,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,450 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:00,450 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:00,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,466 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:00,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:00,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:00,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:00,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:00,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:00,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:00,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:00,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:00,509 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:00,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:00,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:00,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:00,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:00,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,560 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:00,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:00,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,599 INFO L205 nArgumentSynthesizer]: 16 stem disjuncts [2019-01-01 21:48:00,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,620 INFO L402 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2019-01-01 21:48:00,621 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:00,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:00,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,720 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:00,720 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:00,735 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:48:00,746 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:48:00,747 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:48:00,749 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:48:00,751 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:48:00,752 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:48:00,753 INFO L520 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, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_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 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 Supporting invariants [] [2019-01-01 21:48:01,628 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2019-01-01 21:48:01,638 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:48:01,645 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:48:01,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:01,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:01,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:01,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:48:01,994 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:48:01,996 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 4 states. [2019-01-01 21:48:02,184 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 4 states. Result 60 states and 79 transitions. Complement of second has 10 states. [2019-01-01 21:48:02,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:48:02,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:48:02,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2019-01-01 21:48:02,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 21:48:02,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:02,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:48:02,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:02,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-01 21:48:02,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:02,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. [2019-01-01 21:48:02,198 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-01-01 21:48:02,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 30 states and 45 transitions. [2019-01-01 21:48:02,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-01 21:48:02,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-01 21:48:02,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 45 transitions. [2019-01-01 21:48:02,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:48:02,206 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 45 transitions. [2019-01-01 21:48:02,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 45 transitions. [2019-01-01 21:48:02,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-01-01 21:48:02,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-01 21:48:02,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2019-01-01 21:48:02,237 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2019-01-01 21:48:02,237 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2019-01-01 21:48:02,237 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:48:02,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 43 transitions. [2019-01-01 21:48:02,238 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-01-01 21:48:02,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:02,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:02,239 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:48:02,239 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:48:02,240 INFO L794 eck$LassoCheckResult]: Stem: 289#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 282#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 283#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 302#L557-1 [2019-01-01 21:48:02,240 INFO L796 eck$LassoCheckResult]: Loop: 302#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 299#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 300#L558 assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; 296#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 302#L557-1 [2019-01-01 21:48:02,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:02,240 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-01 21:48:02,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:02,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:02,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:02,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:02,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:02,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:02,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1298969, now seen corresponding path program 1 times [2019-01-01 21:48:02,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:02,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:02,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:02,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:02,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:02,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:02,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1806908732, now seen corresponding path program 1 times [2019-01-01 21:48:02,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:02,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:02,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:02,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:02,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:02,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:48:02,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:48:02,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 21:48:03,574 WARN L181 SmtUtils]: Spent 921.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-01-01 21:48:03,837 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-01-01 21:48:03,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:48:03,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:48:03,842 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. cyclomatic complexity: 18 Second operand 5 states. [2019-01-01 21:48:03,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:48:03,899 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2019-01-01 21:48:03,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:48:03,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 65 transitions. [2019-01-01 21:48:03,903 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 25 [2019-01-01 21:48:03,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 36 states and 51 transitions. [2019-01-01 21:48:03,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-01-01 21:48:03,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-01-01 21:48:03,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 51 transitions. [2019-01-01 21:48:03,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:48:03,905 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 51 transitions. [2019-01-01 21:48:03,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 51 transitions. [2019-01-01 21:48:03,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 19. [2019-01-01 21:48:03,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-01 21:48:03,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2019-01-01 21:48:03,908 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-01-01 21:48:03,908 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-01-01 21:48:03,908 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:48:03,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2019-01-01 21:48:03,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 21:48:03,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:03,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:03,910 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:48:03,911 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:48:03,911 INFO L794 eck$LassoCheckResult]: Stem: 376#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 369#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 370#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 377#L557-1 [2019-01-01 21:48:03,912 INFO L796 eck$LassoCheckResult]: Loop: 377#L557-1 assume test_fun_#t~short10; 378#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 371#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 372#L561 assume !(test_fun_#t~mem14 > test_fun_#t~mem15);havoc test_fun_#t~mem14;havoc test_fun_#t~mem15; 382#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 377#L557-1 [2019-01-01 21:48:03,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:03,913 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2019-01-01 21:48:03,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:03,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:03,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:03,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:03,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:03,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:03,942 INFO L82 PathProgramCache]: Analyzing trace with hash 38423577, now seen corresponding path program 1 times [2019-01-01 21:48:03,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:03,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:03,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:03,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:48:03,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:03,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:03,953 INFO L82 PathProgramCache]: Analyzing trace with hash 177751382, now seen corresponding path program 1 times [2019-01-01 21:48:03,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:03,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:03,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:03,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:03,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:04,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:48:04,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:48:04,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 21:48:04,219 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-01-01 21:48:04,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:48:04,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:48:04,279 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-01 21:48:04,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:48:04,321 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-01-01 21:48:04,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:48:04,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2019-01-01 21:48:04,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 21:48:04,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 20 transitions. [2019-01-01 21:48:04,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-01 21:48:04,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-01 21:48:04,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2019-01-01 21:48:04,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:48:04,325 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-01 21:48:04,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2019-01-01 21:48:04,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-01 21:48:04,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-01 21:48:04,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-01-01 21:48:04,327 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-01 21:48:04,327 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-01 21:48:04,327 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:48:04,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2019-01-01 21:48:04,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 21:48:04,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:04,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:04,329 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:48:04,329 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:48:04,329 INFO L794 eck$LassoCheckResult]: Stem: 424#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 418#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 419#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 425#L557-1 [2019-01-01 21:48:04,329 INFO L796 eck$LassoCheckResult]: Loop: 425#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 426#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 431#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 429#L561 assume !(test_fun_#t~mem14 > test_fun_#t~mem15);havoc test_fun_#t~mem14;havoc test_fun_#t~mem15; 430#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 425#L557-1 [2019-01-01 21:48:04,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:04,329 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 3 times [2019-01-01 21:48:04,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:04,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:04,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:04,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:04,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:04,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:04,356 INFO L82 PathProgramCache]: Analyzing trace with hash 40270619, now seen corresponding path program 1 times [2019-01-01 21:48:04,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:04,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:04,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:04,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:48:04,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:04,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:48:04,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:48:04,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:48:04,437 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:48:04,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:48:04,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:48:04,438 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-01-01 21:48:04,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:48:04,511 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-01-01 21:48:04,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:48:04,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2019-01-01 21:48:04,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:48:04,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 18 transitions. [2019-01-01 21:48:04,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 21:48:04,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:48:04,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2019-01-01 21:48:04,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:48:04,515 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-01-01 21:48:04,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2019-01-01 21:48:04,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-01 21:48:04,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 21:48:04,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-01-01 21:48:04,517 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-01-01 21:48:04,517 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-01-01 21:48:04,517 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:48:04,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-01-01 21:48:04,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:48:04,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:04,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:04,520 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:48:04,520 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:48:04,520 INFO L794 eck$LassoCheckResult]: Stem: 465#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 459#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 460#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 466#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 467#L557-3 [2019-01-01 21:48:04,521 INFO L796 eck$LassoCheckResult]: Loop: 467#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 471#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 470#L561 assume test_fun_#t~mem14 > test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem15;call test_fun_#t~mem16 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem16 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem16; 462#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 472#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 467#L557-3 [2019-01-01 21:48:04,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:04,522 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2019-01-01 21:48:04,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:04,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:04,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:04,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:04,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:04,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:04,565 INFO L82 PathProgramCache]: Analyzing trace with hash 45962937, now seen corresponding path program 1 times [2019-01-01 21:48:04,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:04,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:04,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:04,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:04,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:04,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:04,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1272581938, now seen corresponding path program 1 times [2019-01-01 21:48:04,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:04,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:04,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:04,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:04,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:04,989 WARN L181 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-01-01 21:48:05,315 WARN L181 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-01-01 21:48:06,294 WARN L181 SmtUtils]: Spent 976.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 135 [2019-01-01 21:48:07,471 WARN L181 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 130 [2019-01-01 21:48:07,476 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:48:07,477 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:48:07,477 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:48:07,477 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:48:07,477 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:48:07,478 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:48:07,478 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:48:07,478 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:48:07,478 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.13-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2019-01-01 21:48:07,478 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:48:07,478 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:48:07,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:07,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:09,246 WARN L181 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 131 DAG size of output: 115 [2019-01-01 21:48:09,636 WARN L181 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2019-01-01 21:48:09,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:09,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:09,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:09,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:09,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:09,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:09,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:09,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:09,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:09,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:09,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:09,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:09,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:09,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:09,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:10,069 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-01-01 21:48:10,288 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-01-01 21:48:11,220 WARN L181 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-01-01 21:48:11,449 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-01-01 21:48:12,636 WARN L181 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-01-01 21:48:12,744 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:48:12,744 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:48:12,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:12,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:12,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:12,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:12,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:12,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:12,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:12,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:12,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:12,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:12,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:12,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:12,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:12,756 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:12,756 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:12,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:12,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:12,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:12,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:12,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:12,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:12,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:12,764 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:12,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:12,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:12,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:12,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:12,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:12,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:12,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:12,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:12,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:12,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:12,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:12,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:12,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:12,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:12,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:12,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:12,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:12,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:12,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:12,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:12,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:12,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:12,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:12,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:12,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:12,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:12,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:12,801 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:48:12,801 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:48:12,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:12,817 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-01 21:48:12,817 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 21:48:12,920 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:48:12,986 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:48:12,987 INFO L444 ModelExtractionUtils]: 87 out of 91 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:48:12,987 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:48:12,990 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-01-01 21:48:12,991 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:48:12,991 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2, 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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_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 [] [2019-01-01 21:48:13,815 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2019-01-01 21:48:13,817 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:48:13,817 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:48:13,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:13,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:13,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:14,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:14,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 58 [2019-01-01 21:48:14,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:14,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2019-01-01 21:48:14,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:14,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:14,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:14,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:14,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 49 [2019-01-01 21:48:14,307 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:14,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:48:14,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:48:14,363 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2019-01-01 21:48:14,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:48:14,413 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:48:14,414 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-01-01 21:48:14,484 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 30 states and 35 transitions. Complement of second has 7 states. [2019-01-01 21:48:14,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:48:14,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:48:14,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-01-01 21:48:14,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 5 letters. [2019-01-01 21:48:14,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:14,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 5 letters. [2019-01-01 21:48:14,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:14,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 10 letters. [2019-01-01 21:48:14,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:14,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2019-01-01 21:48:14,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:48:14,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 28 transitions. [2019-01-01 21:48:14,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-01 21:48:14,493 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-01 21:48:14,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2019-01-01 21:48:14,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:48:14,494 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-01-01 21:48:14,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2019-01-01 21:48:14,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-01-01 21:48:14,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-01 21:48:14,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-01-01 21:48:14,496 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-01-01 21:48:14,496 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-01-01 21:48:14,496 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:48:14,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2019-01-01 21:48:14,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:48:14,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:14,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:14,499 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:48:14,499 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:48:14,500 INFO L794 eck$LassoCheckResult]: Stem: 726#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 720#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 721#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 734#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 737#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 735#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 732#L561 assume test_fun_#t~mem14 > test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem15;call test_fun_#t~mem16 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem16 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem16; 733#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 727#L557-1 assume test_fun_#t~short10; 728#L557-3 [2019-01-01 21:48:14,500 INFO L796 eck$LassoCheckResult]: Loop: 728#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 722#L558 assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; 723#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 741#L557-1 assume test_fun_#t~short10; 728#L557-3 [2019-01-01 21:48:14,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:14,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1272581936, now seen corresponding path program 1 times [2019-01-01 21:48:14,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:14,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:14,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:14,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:14,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:14,794 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 21:48:14,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:48:14,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:48:14,822 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:48:14,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:14,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:14,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:14,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-01 21:48:15,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:15,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:15,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-01 21:48:15,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:15,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:15,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:15,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:15,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-01 21:48:15,073 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:15,081 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:15,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:15,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:15,099 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:13 [2019-01-01 21:48:15,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:15,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 46 [2019-01-01 21:48:15,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:15,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-01 21:48:15,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:15,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:15,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:15,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:16 [2019-01-01 21:48:15,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:48:15,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:48:15,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-01-01 21:48:15,296 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:48:15,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:15,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1480167, now seen corresponding path program 2 times [2019-01-01 21:48:15,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:15,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:15,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:15,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:15,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:15,521 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-01-01 21:48:15,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 21:48:15,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-01-01 21:48:15,555 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. cyclomatic complexity: 7 Second operand 11 states. [2019-01-01 21:48:15,764 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-01 21:48:15,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:48:15,769 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-01-01 21:48:15,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 21:48:15,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-01-01 21:48:15,771 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:48:15,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2019-01-01 21:48:15,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:48:15,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:48:15,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:48:15,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:48:15,772 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:48:15,772 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:48:15,772 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:48:15,772 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:48:15,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:48:15,772 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:48:15,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:48:15,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:48:15 BoogieIcfgContainer [2019-01-01 21:48:15,780 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:48:15,780 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:48:15,780 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:48:15,781 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:48:15,781 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:47:53" (3/4) ... [2019-01-01 21:48:15,785 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:48:15,785 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:48:15,786 INFO L168 Benchmark]: Toolchain (without parser) took 23175.10 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 372.2 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -395.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:48:15,787 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:48:15,789 INFO L168 Benchmark]: CACSL2BoogieTranslator took 612.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -187.3 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:48:15,791 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.76 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:48:15,792 INFO L168 Benchmark]: Boogie Preprocessor took 29.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:48:15,792 INFO L168 Benchmark]: RCFGBuilder took 479.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:48:15,793 INFO L168 Benchmark]: BuchiAutomizer took 21989.91 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 218.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -240.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:48:15,794 INFO L168 Benchmark]: Witness Printer took 5.15 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:48:15,801 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 612.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -187.3 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.76 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 479.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21989.91 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 218.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -240.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 5.15 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[z_ref][z_ref] and consists of 6 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z_ref][z_ref] + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 21.9s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 20.1s. Construction of modules took 0.2s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 39 SDtfs, 64 SDslu, 37 SDs, 0 SdLazy, 138 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital648 mio100 ax103 hnf99 lsp73 ukn74 mio100 lsp28 div100 bol104 ite100 ukn100 eq182 hnf88 smp96 dnf621 smp90 tf100 neg91 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 112ms VariablesStem: 9 VariablesLoop: 8 DisjunctsStem: 16 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 36 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...