./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.12-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_101279ec-422d-48a0-8b12-32fb8d07dca8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_101279ec-422d-48a0-8b12-32fb8d07dca8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_101279ec-422d-48a0-8b12-32fb8d07dca8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_101279ec-422d-48a0-8b12-32fb8d07dca8/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.12-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_101279ec-422d-48a0-8b12-32fb8d07dca8/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_101279ec-422d-48a0-8b12-32fb8d07dca8/bin-2019/uautomizer --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 27b51ff95b1c87aada11269295eff3fc5c30957f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 10:44:54,612 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 10:44:54,613 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 10:44:54,619 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 10:44:54,619 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 10:44:54,619 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 10:44:54,620 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 10:44:54,621 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 10:44:54,621 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 10:44:54,622 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 10:44:54,622 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 10:44:54,622 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 10:44:54,623 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 10:44:54,623 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 10:44:54,624 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 10:44:54,624 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 10:44:54,625 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 10:44:54,625 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 10:44:54,626 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 10:44:54,627 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 10:44:54,628 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 10:44:54,628 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 10:44:54,629 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 10:44:54,630 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 10:44:54,630 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 10:44:54,630 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 10:44:54,631 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 10:44:54,631 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 10:44:54,631 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 10:44:54,632 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 10:44:54,632 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 10:44:54,632 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 10:44:54,633 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 10:44:54,633 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 10:44:54,633 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 10:44:54,634 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 10:44:54,634 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_101279ec-422d-48a0-8b12-32fb8d07dca8/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-08 10:44:54,641 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 10:44:54,641 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 10:44:54,642 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 10:44:54,642 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 10:44:54,642 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 10:44:54,642 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 10:44:54,642 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 10:44:54,643 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 10:44:54,643 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 10:44:54,643 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 10:44:54,643 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 10:44:54,643 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 10:44:54,643 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 10:44:54,643 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 10:44:54,643 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 10:44:54,643 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 10:44:54,643 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 10:44:54,643 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 10:44:54,643 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 10:44:54,643 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 10:44:54,644 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 10:44:54,644 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 10:44:54,644 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 10:44:54,644 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 10:44:54,644 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 10:44:54,644 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 10:44:54,644 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 10:44:54,644 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 10:44:54,645 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 10:44:54,645 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_101279ec-422d-48a0-8b12-32fb8d07dca8/bin-2019/uautomizer 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 -> 27b51ff95b1c87aada11269295eff3fc5c30957f [2018-12-08 10:44:54,661 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 10:44:54,668 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 10:44:54,670 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 10:44:54,670 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 10:44:54,671 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 10:44:54,671 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_101279ec-422d-48a0-8b12-32fb8d07dca8/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.12-alloca_true-termination_true-no-overflow.c.i [2018-12-08 10:44:54,705 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_101279ec-422d-48a0-8b12-32fb8d07dca8/bin-2019/uautomizer/data/c4ad0ad55/78913ef7b1d243b68f27ccfb130995cd/FLAG461bafb20 [2018-12-08 10:44:55,144 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 10:44:55,144 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_101279ec-422d-48a0-8b12-32fb8d07dca8/sv-benchmarks/c/termination-memory-alloca/b.12-alloca_true-termination_true-no-overflow.c.i [2018-12-08 10:44:55,150 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_101279ec-422d-48a0-8b12-32fb8d07dca8/bin-2019/uautomizer/data/c4ad0ad55/78913ef7b1d243b68f27ccfb130995cd/FLAG461bafb20 [2018-12-08 10:44:55,158 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_101279ec-422d-48a0-8b12-32fb8d07dca8/bin-2019/uautomizer/data/c4ad0ad55/78913ef7b1d243b68f27ccfb130995cd [2018-12-08 10:44:55,160 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 10:44:55,161 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 10:44:55,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 10:44:55,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 10:44:55,164 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 10:44:55,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:44:55" (1/1) ... [2018-12-08 10:44:55,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c6a5933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:44:55, skipping insertion in model container [2018-12-08 10:44:55,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:44:55" (1/1) ... [2018-12-08 10:44:55,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 10:44:55,187 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 10:44:55,324 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 10:44:55,367 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 10:44:55,388 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 10:44:55,406 INFO L195 MainTranslator]: Completed translation [2018-12-08 10:44:55,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:44:55 WrapperNode [2018-12-08 10:44:55,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 10:44:55,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 10:44:55,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 10:44:55,407 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 10:44:55,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:44:55" (1/1) ... [2018-12-08 10:44:55,420 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:44:55" (1/1) ... [2018-12-08 10:44:55,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 10:44:55,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 10:44:55,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 10:44:55,432 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 10:44:55,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:44:55" (1/1) ... [2018-12-08 10:44:55,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:44:55" (1/1) ... [2018-12-08 10:44:55,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:44:55" (1/1) ... [2018-12-08 10:44:55,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:44:55" (1/1) ... [2018-12-08 10:44:55,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:44:55" (1/1) ... [2018-12-08 10:44:55,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:44:55" (1/1) ... [2018-12-08 10:44:55,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:44:55" (1/1) ... [2018-12-08 10:44:55,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 10:44:55,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 10:44:55,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 10:44:55,446 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 10:44:55,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:44:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_101279ec-422d-48a0-8b12-32fb8d07dca8/bin-2019/uautomizer/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 [2018-12-08 10:44:55,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 10:44:55,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 10:44:55,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 10:44:55,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 10:44:55,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 10:44:55,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 10:44:55,597 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 10:44:55,598 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-08 10:44:55,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:44:55 BoogieIcfgContainer [2018-12-08 10:44:55,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 10:44:55,598 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 10:44:55,598 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 10:44:55,601 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 10:44:55,601 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 10:44:55,601 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 10:44:55" (1/3) ... [2018-12-08 10:44:55,602 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3190b459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 10:44:55, skipping insertion in model container [2018-12-08 10:44:55,602 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 10:44:55,602 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:44:55" (2/3) ... [2018-12-08 10:44:55,602 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3190b459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 10:44:55, skipping insertion in model container [2018-12-08 10:44:55,602 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 10:44:55,602 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:44:55" (3/3) ... [2018-12-08 10:44:55,603 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.12-alloca_true-termination_true-no-overflow.c.i [2018-12-08 10:44:55,636 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 10:44:55,636 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 10:44:55,636 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 10:44:55,636 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 10:44:55,636 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 10:44:55,636 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 10:44:55,636 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 10:44:55,637 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 10:44:55,637 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 10:44:55,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-08 10:44:55,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 10:44:55,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:44:55,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:44:55,664 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 10:44:55,664 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 10:44:55,664 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 10:44:55,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-08 10:44:55,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 10:44:55,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:44:55,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:44:55,665 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 10:44:55,665 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 10:44:55,670 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(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.alloc(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.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 7#L559-2true [2018-12-08 10:44:55,670 INFO L796 eck$LassoCheckResult]: Loop: 7#L559-2true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 13#L555-1true assume test_fun_#t~short7; 5#L555-3true assume !!test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short7;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 8#L556true assume test_fun_#t~mem8 > 0;havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 7#L559-2true [2018-12-08 10:44:55,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:44:55,674 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-08 10:44:55,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:44:55,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:44:55,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:55,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:44:55,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:44:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:44:55,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:44:55,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 1 times [2018-12-08 10:44:55,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:44:55,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:44:55,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:55,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:44:55,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:44:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:44:55,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:44:55,774 INFO L82 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2018-12-08 10:44:55,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:44:55,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:44:55,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:55,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:44:55,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:44:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:44:56,033 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2018-12-08 10:44:56,108 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 10:44:56,109 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 10:44:56,109 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 10:44:56,109 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 10:44:56,109 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 10:44:56,109 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:44:56,109 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 10:44:56,109 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 10:44:56,109 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.12-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-12-08 10:44:56,109 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 10:44:56,110 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 10:44:56,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:56,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:56,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:56,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:56,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:56,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:56,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:56,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:56,295 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2018-12-08 10:44:56,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:56,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:56,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:56,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:56,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:56,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:56,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:56,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:56,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:56,595 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 10:44:56,598 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 10:44:56,599 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 [2018-12-08 10:44:56,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:56,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:44:56,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:56,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:56,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:56,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:44:56,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:44:56,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:56,604 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 [2018-12-08 10:44:56,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:56,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:44:56,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:56,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:56,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:56,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:44:56,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:44:56,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:56,606 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 [2018-12-08 10:44:56,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:56,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:56,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:56,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:56,608 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:44:56,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:44:56,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:56,615 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 [2018-12-08 10:44:56,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:56,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:44:56,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:56,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:56,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:56,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:44:56,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:44:56,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:56,617 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 [2018-12-08 10:44:56,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:56,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:44:56,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:56,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:56,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:56,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:44:56,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:44:56,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:56,619 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 [2018-12-08 10:44:56,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:56,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:56,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:56,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:56,620 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:44:56,620 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:44:56,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:56,623 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 [2018-12-08 10:44:56,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:56,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:56,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:56,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:56,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:44:56,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:44:56,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:56,626 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 [2018-12-08 10:44:56,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:56,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:56,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:56,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:56,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:44:56,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:44:56,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:56,631 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 [2018-12-08 10:44:56,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:56,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:56,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:56,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:56,633 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:44:56,633 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:44:56,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:56,639 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 [2018-12-08 10:44:56,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:56,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:56,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:56,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:56,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:44:56,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:44:56,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:56,644 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 [2018-12-08 10:44:56,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:56,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:56,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:56,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:56,646 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:44:56,646 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:44:56,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:56,648 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 [2018-12-08 10:44:56,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:56,649 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:44:56,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:56,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:56,650 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:44:56,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:44:56,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:56,654 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 [2018-12-08 10:44:56,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:56,655 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:44:56,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:56,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:56,656 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:44:56,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:44:56,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:56,662 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 [2018-12-08 10:44:56,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:56,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:56,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:56,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:56,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:44:56,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:44:56,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:56,665 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 [2018-12-08 10:44:56,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:56,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:56,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:56,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:56,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:44:56,667 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:44:56,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:56,668 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 [2018-12-08 10:44:56,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:56,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:56,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:56,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:56,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:44:56,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:44:56,678 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 10:44:56,683 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 10:44:56,683 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 10:44:56,684 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 10:44:56,685 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 10:44:56,685 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 10:44:56,686 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) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-12-08 10:44:56,717 INFO L297 tatePredicateManager]: 19 out of 19 supporting invariants were superfluous and have been removed [2018-12-08 10:44:56,721 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 10:44:56,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:44:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:44:56,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:44:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:44:56,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:44:56,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:44:56,796 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 [2018-12-08 10:44:56,796 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 4 states. [2018-12-08 10:44:56,854 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 4 states. Result 50 states and 67 transitions. Complement of second has 9 states. [2018-12-08 10:44:56,854 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 [2018-12-08 10:44:56,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 10:44:56,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2018-12-08 10:44:56,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 2 letters. Loop has 4 letters. [2018-12-08 10:44:56,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:44:56,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-08 10:44:56,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:44:56,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 2 letters. Loop has 8 letters. [2018-12-08 10:44:56,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:44:56,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 67 transitions. [2018-12-08 10:44:56,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-08 10:44:56,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 25 states and 39 transitions. [2018-12-08 10:44:56,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-08 10:44:56,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-08 10:44:56,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 39 transitions. [2018-12-08 10:44:56,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:44:56,866 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 39 transitions. [2018-12-08 10:44:56,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 39 transitions. [2018-12-08 10:44:56,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-12-08 10:44:56,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-08 10:44:56,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2018-12-08 10:44:56,884 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 37 transitions. [2018-12-08 10:44:56,885 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 37 transitions. [2018-12-08 10:44:56,885 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 10:44:56,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 37 transitions. [2018-12-08 10:44:56,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-08 10:44:56,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:44:56,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:44:56,886 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-08 10:44:56,886 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 10:44:56,886 INFO L794 eck$LassoCheckResult]: Stem: 189#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 187#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(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.alloc(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.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 188#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 195#L555-1 [2018-12-08 10:44:56,886 INFO L796 eck$LassoCheckResult]: Loop: 195#L555-1 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 > 0; 190#L555-3 assume !!test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short7;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 191#L556 assume test_fun_#t~mem8 > 0;havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 194#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 195#L555-1 [2018-12-08 10:44:56,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:44:56,886 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-12-08 10:44:56,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:44:56,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:44:56,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:56,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:44:56,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:44:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:44:56,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:44:56,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1298969, now seen corresponding path program 1 times [2018-12-08 10:44:56,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:44:56,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:44:56,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:56,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:44:56,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:44:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:44:56,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:44:56,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1806908732, now seen corresponding path program 1 times [2018-12-08 10:44:56,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:44:56,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:44:56,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:56,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:44:56,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:44:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:44:56,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:44:56,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:44:57,154 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-12-08 10:44:57,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 10:44:57,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:44:57,157 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-12-08 10:44:57,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:44:57,191 INFO L93 Difference]: Finished difference Result 38 states and 55 transitions. [2018-12-08 10:44:57,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 10:44:57,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 55 transitions. [2018-12-08 10:44:57,193 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-08 10:44:57,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 28 states and 39 transitions. [2018-12-08 10:44:57,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-08 10:44:57,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-08 10:44:57,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 39 transitions. [2018-12-08 10:44:57,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:44:57,195 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2018-12-08 10:44:57,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 39 transitions. [2018-12-08 10:44:57,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 14. [2018-12-08 10:44:57,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-08 10:44:57,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2018-12-08 10:44:57,196 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-12-08 10:44:57,196 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-12-08 10:44:57,196 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 10:44:57,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2018-12-08 10:44:57,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 10:44:57,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:44:57,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:44:57,197 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-08 10:44:57,197 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 10:44:57,198 INFO L794 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 261#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(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.alloc(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.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 262#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 269#L555-1 [2018-12-08 10:44:57,198 INFO L796 eck$LassoCheckResult]: Loop: 269#L555-1 assume test_fun_#t~short7; 264#L555-3 assume !!test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short7;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 265#L556 assume !(test_fun_#t~mem8 > 0);havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 272#L559 assume test_fun_#t~mem10 > 0;havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 268#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 269#L555-1 [2018-12-08 10:44:57,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:44:57,198 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2018-12-08 10:44:57,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:44:57,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:44:57,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:57,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:44:57,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:44:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:44:57,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:44:57,214 INFO L82 PathProgramCache]: Analyzing trace with hash 38423515, now seen corresponding path program 1 times [2018-12-08 10:44:57,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:44:57,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:44:57,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:57,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:44:57,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:44:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:44:57,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:44:57,224 INFO L82 PathProgramCache]: Analyzing trace with hash 177751320, now seen corresponding path program 1 times [2018-12-08 10:44:57,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:44:57,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:44:57,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:57,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:44:57,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:44:57,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:44:57,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:44:57,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:44:57,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 10:44:57,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:44:57,310 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-12-08 10:44:57,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:44:57,325 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-12-08 10:44:57,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 10:44:57,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-12-08 10:44:57,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 10:44:57,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 12 states and 15 transitions. [2018-12-08 10:44:57,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-08 10:44:57,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-08 10:44:57,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2018-12-08 10:44:57,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:44:57,327 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-12-08 10:44:57,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2018-12-08 10:44:57,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-08 10:44:57,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-08 10:44:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2018-12-08 10:44:57,328 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-12-08 10:44:57,328 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-12-08 10:44:57,328 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 10:44:57,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2018-12-08 10:44:57,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 10:44:57,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:44:57,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:44:57,329 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-08 10:44:57,329 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 10:44:57,329 INFO L794 eck$LassoCheckResult]: Stem: 303#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 301#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(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.alloc(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.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 302#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 309#L555-1 [2018-12-08 10:44:57,329 INFO L796 eck$LassoCheckResult]: Loop: 309#L555-1 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 > 0; 304#L555-3 assume !!test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short7;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 305#L556 assume !(test_fun_#t~mem8 > 0);havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 312#L559 assume test_fun_#t~mem10 > 0;havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 308#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 309#L555-1 [2018-12-08 10:44:57,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:44:57,329 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 3 times [2018-12-08 10:44:57,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:44:57,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:44:57,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:57,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:44:57,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:44:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:44:57,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:44:57,340 INFO L82 PathProgramCache]: Analyzing trace with hash 40270557, now seen corresponding path program 1 times [2018-12-08 10:44:57,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:44:57,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:44:57,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:57,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:44:57,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:44:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:44:57,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:44:57,350 INFO L82 PathProgramCache]: Analyzing trace with hash 179598362, now seen corresponding path program 1 times [2018-12-08 10:44:57,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:44:57,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:44:57,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:57,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:44:57,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:44:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:44:57,640 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2018-12-08 10:44:57,814 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-12-08 10:44:57,816 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 10:44:57,816 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 10:44:57,816 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 10:44:57,816 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 10:44:57,816 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 10:44:57,816 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:44:57,816 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 10:44:57,816 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 10:44:57,816 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.12-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2018-12-08 10:44:57,816 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 10:44:57,816 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 10:44:57,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44: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 [2018-12-08 10:44:57,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:57,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:57,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:57,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:57,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:57,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:57,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:58,216 WARN L180 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2018-12-08 10:44:58,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:58,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:58,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:58,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:58,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:58,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:44:58,595 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 10:44:58,595 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 10:44:58,595 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 [2018-12-08 10:44:58,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:58,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:44:58,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:58,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:58,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:58,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:44:58,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:44:58,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:58,597 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 [2018-12-08 10:44:58,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:58,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:44:58,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:58,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:58,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:58,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:44:58,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:44:58,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:58,599 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 [2018-12-08 10:44:58,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:58,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:58,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:58,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:58,600 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:44:58,600 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:44:58,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:58,601 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 [2018-12-08 10:44:58,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:58,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:44:58,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:58,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:58,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:58,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:44:58,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:44:58,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:58,602 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 [2018-12-08 10:44:58,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:58,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:58,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:58,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:58,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:44:58,603 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:44:58,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:58,605 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 [2018-12-08 10:44:58,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:58,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:44:58,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:58,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:58,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:58,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:44:58,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:44:58,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:58,607 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 [2018-12-08 10:44:58,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:58,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:44:58,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:58,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:58,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:58,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:44:58,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:44:58,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:58,608 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 [2018-12-08 10:44:58,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:58,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:58,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:58,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:58,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:44:58,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:44:58,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:58,610 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 [2018-12-08 10:44:58,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:58,610 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:44:58,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:58,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:58,611 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:44:58,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:44:58,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:58,614 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 [2018-12-08 10:44:58,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:58,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:58,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:58,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:58,615 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:44:58,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:44:58,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:58,617 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 [2018-12-08 10:44:58,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:58,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:58,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:58,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:58,620 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:44:58,620 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:44:58,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:58,630 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 [2018-12-08 10:44:58,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:58,630 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:44:58,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:58,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:58,633 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:44:58,633 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:44:58,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:58,636 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 [2018-12-08 10:44:58,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:58,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:58,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:58,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:58,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:44:58,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:44:58,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:58,640 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 [2018-12-08 10:44:58,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:58,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:58,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:58,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:58,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:44:58,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:44:58,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:58,644 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 [2018-12-08 10:44:58,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:58,644 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:44:58,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:58,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:58,645 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:44:58,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:44:58,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:58,650 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 [2018-12-08 10:44:58,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:58,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:58,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:58,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:58,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:44:58,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:44:58,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:58,655 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 [2018-12-08 10:44:58,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:58,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:58,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:58,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:58,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:44:58,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:44:58,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:44:58,660 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 [2018-12-08 10:44:58,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:44:58,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:44:58,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:44:58,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:44:58,662 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:44:58,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:44:58,667 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 10:44:58,671 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 10:44:58,671 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 10:44:58,671 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 10:44:58,672 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 10:44:58,672 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 10:44:58,673 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2018-12-08 10:44:58,734 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-12-08 10:44:58,735 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 10:44:58,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:44:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:44:58,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:44:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:44:58,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:44:58,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:44:58,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-08 10:44:58,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:44:58,823 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 33 treesize of output 22 [2018-12-08 10:44:58,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:44:58,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:44:58,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:44:58,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-12-08 10:44:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:44:58,838 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-08 10:44:58,838 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-12-08 10:44:58,863 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 31 states and 38 transitions. Complement of second has 8 states. [2018-12-08 10:44:58,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 10:44:58,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 10:44:58,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-12-08 10:44:58,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 3 letters. Loop has 5 letters. [2018-12-08 10:44:58,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:44:58,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 8 letters. Loop has 5 letters. [2018-12-08 10:44:58,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:44:58,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 3 letters. Loop has 10 letters. [2018-12-08 10:44:58,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:44:58,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2018-12-08 10:44:58,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 10:44:58,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 38 transitions. [2018-12-08 10:44:58,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-08 10:44:58,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-08 10:44:58,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2018-12-08 10:44:58,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:44:58,865 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-12-08 10:44:58,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2018-12-08 10:44:58,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-12-08 10:44:58,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-08 10:44:58,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-12-08 10:44:58,866 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-12-08 10:44:58,866 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-12-08 10:44:58,866 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 10:44:58,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2018-12-08 10:44:58,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 10:44:58,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:44:58,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:44:58,867 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-08 10:44:58,867 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 10:44:58,868 INFO L794 eck$LassoCheckResult]: Stem: 490#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 488#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(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.alloc(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.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 489#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 511#L555-1 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 > 0; 491#L555-3 [2018-12-08 10:44:58,868 INFO L796 eck$LassoCheckResult]: Loop: 491#L555-3 assume !!test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short7;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 492#L556 assume !(test_fun_#t~mem8 > 0);havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 499#L559 assume !(test_fun_#t~mem10 > 0);havoc test_fun_#t~mem10; 495#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 496#L555-1 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 > 0; 491#L555-3 [2018-12-08 10:44:58,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:44:58,868 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-12-08 10:44:58,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:44:58,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:44:58,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:58,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:44:58,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:44:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:44:58,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:44:58,882 INFO L82 PathProgramCache]: Analyzing trace with hash 45964859, now seen corresponding path program 1 times [2018-12-08 10:44:58,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:44:58,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:44:58,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:58,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:44:58,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:44:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:44:58,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:44:58,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1272583860, now seen corresponding path program 1 times [2018-12-08 10:44:58,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:44:58,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:44:58,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:58,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:44:58,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:44:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:44:58,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:44:58,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:44:58,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:44:58,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 10:44:58,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:44:58,975 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-12-08 10:44:58,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:44:58,990 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2018-12-08 10:44:58,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 10:44:58,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2018-12-08 10:44:58,990 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 10:44:58,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2018-12-08 10:44:58,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 10:44:58,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 10:44:58,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 10:44:58,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 10:44:58,991 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 10:44:58,991 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 10:44:58,991 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 10:44:58,991 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 10:44:58,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 10:44:58,991 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 10:44:58,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 10:44:58,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 10:44:58 BoogieIcfgContainer [2018-12-08 10:44:58,995 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 10:44:58,995 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 10:44:58,995 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 10:44:58,996 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 10:44:58,996 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:44:55" (3/4) ... [2018-12-08 10:44:58,999 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 10:44:58,999 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 10:44:59,000 INFO L168 Benchmark]: Toolchain (without parser) took 3839.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -158.8 MB). Peak memory consumption was 5.3 MB. Max. memory is 11.5 GB. [2018-12-08 10:44:59,000 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 10:44:59,001 INFO L168 Benchmark]: CACSL2BoogieTranslator took 245.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -147.9 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2018-12-08 10:44:59,001 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 10:44:59,002 INFO L168 Benchmark]: Boogie Preprocessor took 13.89 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 10:44:59,002 INFO L168 Benchmark]: RCFGBuilder took 151.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-08 10:44:59,002 INFO L168 Benchmark]: BuchiAutomizer took 3396.85 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 54.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -33.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2018-12-08 10:44:59,003 INFO L168 Benchmark]: Witness Printer took 3.83 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. [2018-12-08 10:44:59,006 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 245.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -147.9 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.89 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 151.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3396.85 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 54.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -33.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.83 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (3 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 2.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 35 SDtfs, 51 SDslu, 34 SDs, 0 SdLazy, 108 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital345 mio100 ax106 hnf99 lsp73 ukn83 mio100 lsp25 div100 bol100 ite100 ukn100 eq199 hnf87 smp100 dnf129 smp81 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...