./Ultimate.py --spec ../../sv-benchmarks/c/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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a1619a23-02c7-4a63-83c5-887e5fcc7842/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a1619a23-02c7-4a63-83c5-887e5fcc7842/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a1619a23-02c7-4a63-83c5-887e5fcc7842/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a1619a23-02c7-4a63-83c5-887e5fcc7842/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_a1619a23-02c7-4a63-83c5-887e5fcc7842/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a1619a23-02c7-4a63-83c5-887e5fcc7842/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-5842f4b [2018-11-18 12:44:59,605 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:44:59,606 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:44:59,615 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:44:59,615 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:44:59,616 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:44:59,616 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:44:59,618 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:44:59,619 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:44:59,620 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:44:59,620 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:44:59,620 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:44:59,621 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:44:59,622 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:44:59,623 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:44:59,623 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:44:59,624 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:44:59,625 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:44:59,626 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:44:59,627 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:44:59,628 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:44:59,629 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:44:59,631 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:44:59,631 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:44:59,631 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:44:59,632 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:44:59,633 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:44:59,633 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:44:59,634 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:44:59,635 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:44:59,635 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:44:59,635 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:44:59,636 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:44:59,636 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:44:59,636 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:44:59,637 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:44:59,637 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a1619a23-02c7-4a63-83c5-887e5fcc7842/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 12:44:59,646 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:44:59,647 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:44:59,648 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:44:59,648 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:44:59,648 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:44:59,648 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 12:44:59,648 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 12:44:59,648 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 12:44:59,648 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 12:44:59,648 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 12:44:59,649 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 12:44:59,649 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:44:59,649 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:44:59,649 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:44:59,649 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:44:59,649 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 12:44:59,649 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 12:44:59,650 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 12:44:59,650 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:44:59,650 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 12:44:59,650 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:44:59,650 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 12:44:59,650 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:44:59,650 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:44:59,650 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 12:44:59,651 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:44:59,651 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:44:59,651 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 12:44:59,652 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 12:44:59,652 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_a1619a23-02c7-4a63-83c5-887e5fcc7842/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-11-18 12:44:59,677 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:44:59,687 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:44:59,690 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:44:59,691 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:44:59,691 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:44:59,692 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a1619a23-02c7-4a63-83c5-887e5fcc7842/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.12-alloca_true-termination_true-no-overflow.c.i [2018-11-18 12:44:59,740 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a1619a23-02c7-4a63-83c5-887e5fcc7842/bin-2019/uautomizer/data/7b9af8975/5839132501b9469fbe21fd97da28e553/FLAG23fc55b4d [2018-11-18 12:45:00,087 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:45:00,087 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a1619a23-02c7-4a63-83c5-887e5fcc7842/sv-benchmarks/c/termination-memory-alloca/b.12-alloca_true-termination_true-no-overflow.c.i [2018-11-18 12:45:00,099 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a1619a23-02c7-4a63-83c5-887e5fcc7842/bin-2019/uautomizer/data/7b9af8975/5839132501b9469fbe21fd97da28e553/FLAG23fc55b4d [2018-11-18 12:45:00,112 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a1619a23-02c7-4a63-83c5-887e5fcc7842/bin-2019/uautomizer/data/7b9af8975/5839132501b9469fbe21fd97da28e553 [2018-11-18 12:45:00,114 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:45:00,115 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:45:00,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:45:00,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:45:00,120 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:45:00,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:45:00" (1/1) ... [2018-11-18 12:45:00,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c62fe61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:45:00, skipping insertion in model container [2018-11-18 12:45:00,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:45:00" (1/1) ... [2018-11-18 12:45:00,132 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:45:00,161 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:45:00,365 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:45:00,373 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:45:00,400 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:45:00,470 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:45:00,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:45:00 WrapperNode [2018-11-18 12:45:00,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:45:00,471 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:45:00,471 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:45:00,471 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:45:00,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:45:00" (1/1) ... [2018-11-18 12:45:00,485 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:45:00" (1/1) ... [2018-11-18 12:45:00,498 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:45:00,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:45:00,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:45:00,498 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:45:00,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:45:00" (1/1) ... [2018-11-18 12:45:00,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:45:00" (1/1) ... [2018-11-18 12:45:00,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:45:00" (1/1) ... [2018-11-18 12:45:00,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:45:00" (1/1) ... [2018-11-18 12:45:00,507 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:45:00" (1/1) ... [2018-11-18 12:45:00,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:45:00" (1/1) ... [2018-11-18 12:45:00,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:45:00" (1/1) ... [2018-11-18 12:45:00,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:45:00,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:45:00,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:45:00,513 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:45:00,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:45:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1619a23-02c7-4a63-83c5-887e5fcc7842/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-11-18 12:45:00,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:45:00,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 12:45:00,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 12:45:00,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 12:45:00,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:45:00,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:45:00,704 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:45:00,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:45:00 BoogieIcfgContainer [2018-11-18 12:45:00,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:45:00,705 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 12:45:00,705 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 12:45:00,707 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 12:45:00,708 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:45:00,708 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 12:45:00" (1/3) ... [2018-11-18 12:45:00,708 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14a9ae82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:45:00, skipping insertion in model container [2018-11-18 12:45:00,709 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:45:00,709 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:45:00" (2/3) ... [2018-11-18 12:45:00,709 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14a9ae82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:45:00, skipping insertion in model container [2018-11-18 12:45:00,709 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:45:00,709 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:45:00" (3/3) ... [2018-11-18 12:45:00,711 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.12-alloca_true-termination_true-no-overflow.c.i [2018-11-18 12:45:00,750 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:45:00,751 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 12:45:00,751 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 12:45:00,751 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 12:45:00,751 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:45:00,751 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:45:00,751 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 12:45:00,752 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:45:00,752 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 12:45:00,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-18 12:45:00,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 12:45:00,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:45:00,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:45:00,781 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:45:00,782 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:45:00,782 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 12:45:00,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-18 12:45:00,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 12:45:00,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:45:00,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:45:00,783 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:45:00,783 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:45:00,790 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;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); 4#L559-2true [2018-11-18 12:45:00,790 INFO L796 eck$LassoCheckResult]: Loop: 4#L559-2true assume true; 7#L555-1true 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; 9#L555-2true assume test_fun_#t~short7; 11#L555-4true assume !!test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 5#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; 4#L559-2true [2018-11-18 12:45:00,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:45:00,794 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 12:45:00,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:45:00,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:45:00,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:00,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:45:00,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:00,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:45:00,887 INFO L82 PathProgramCache]: Analyzing trace with hash 34419787, now seen corresponding path program 1 times [2018-11-18 12:45:00,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:45:00,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:45:00,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:00,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:45:00,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:00,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:45:00,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1805859273, now seen corresponding path program 1 times [2018-11-18 12:45:00,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:45:00,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:45:00,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:00,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:45:00,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:01,046 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2018-11-18 12:45:01,262 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2018-11-18 12:45:01,349 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:45:01,350 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:45:01,350 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:45:01,350 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:45:01,350 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:45:01,351 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:45:01,351 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:45:01,351 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:45:01,351 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.12-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-11-18 12:45:01,351 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:45:01,351 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:45:01,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:01,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:01,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:01,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:01,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:01,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:01,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:01,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:01,597 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2018-11-18 12:45:01,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:01,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:01,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:01,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:01,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:01,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:01,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:01,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:01,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:01,941 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:45:01,945 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:45:01,946 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-11-18 12:45:01,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:01,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:45:01,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:01,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:01,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:01,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:45:01,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:45:01,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:01,953 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-11-18 12:45:01,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:01,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:45:01,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:01,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:01,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:01,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:45:01,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:45:01,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:01,956 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-11-18 12:45:01,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:01,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:01,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:01,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:01,960 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:01,960 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:01,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:01,964 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-11-18 12:45:01,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:01,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:45:01,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:01,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:01,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:01,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:45:01,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:45:01,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:01,967 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-11-18 12:45:01,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:01,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:45:01,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:01,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:01,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:01,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:45:01,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:45:01,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:01,970 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-11-18 12:45:01,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:01,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:01,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:01,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:01,973 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:01,973 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:01,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:01,978 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-11-18 12:45:01,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:01,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:01,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:01,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:01,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:01,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:01,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:01,983 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-11-18 12:45:01,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:01,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:01,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:01,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:01,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:01,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:01,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:01,991 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-11-18 12:45:01,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:01,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:01,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:01,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:01,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:01,994 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:02,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:02,003 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-11-18 12:45:02,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:02,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:02,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:02,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:02,006 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:02,006 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:02,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:02,011 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-11-18 12:45:02,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:02,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:02,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:02,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:02,013 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:02,013 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:02,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:02,017 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-11-18 12:45:02,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:02,018 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:45:02,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:02,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:02,020 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:45:02,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:02,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:02,027 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-11-18 12:45:02,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:02,028 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:45:02,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:02,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:02,030 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:45:02,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:02,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:02,039 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-11-18 12:45:02,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:02,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:02,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:02,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:02,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:02,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:02,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:02,045 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-11-18 12:45:02,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:02,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:02,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:02,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:02,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:02,046 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:02,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:02,049 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-11-18 12:45:02,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:02,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:02,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:02,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:02,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:02,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:02,066 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:45:02,072 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 12:45:02,072 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 12:45:02,074 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:45:02,075 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:45:02,076 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:45:02,077 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-11-18 12:45:02,131 INFO L297 tatePredicateManager]: 19 out of 19 supporting invariants were superfluous and have been removed [2018-11-18 12:45:02,135 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:45:02,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:45:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:45:02,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:45:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:45:02,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:45:02,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:45:02,221 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-11-18 12:45:02,222 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 5 states. [2018-11-18 12:45:02,295 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 5 states. Result 54 states and 70 transitions. Complement of second has 9 states. [2018-11-18 12:45:02,296 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-11-18 12:45:02,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 12:45:02,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2018-11-18 12:45:02,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-18 12:45:02,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:45:02,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-18 12:45:02,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:45:02,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-18 12:45:02,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:45:02,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 70 transitions. [2018-11-18 12:45:02,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-18 12:45:02,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 29 states and 42 transitions. [2018-11-18 12:45:02,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-18 12:45:02,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-18 12:45:02,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 42 transitions. [2018-11-18 12:45:02,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:45:02,312 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2018-11-18 12:45:02,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 42 transitions. [2018-11-18 12:45:02,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-18 12:45:02,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 12:45:02,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. [2018-11-18 12:45:02,331 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 41 transitions. [2018-11-18 12:45:02,331 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 41 transitions. [2018-11-18 12:45:02,331 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 12:45:02,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 41 transitions. [2018-11-18 12:45:02,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-18 12:45:02,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:45:02,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:45:02,333 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 12:45:02,333 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:45:02,333 INFO L794 eck$LassoCheckResult]: Stem: 202#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 195#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;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); 196#L559-2 assume true; 204#L555-1 [2018-11-18 12:45:02,333 INFO L796 eck$LassoCheckResult]: Loop: 204#L555-1 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; 197#L555-2 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; 199#L555-4 assume !!test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 207#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; 203#L559-2 assume true; 204#L555-1 [2018-11-18 12:45:02,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:45:02,333 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2018-11-18 12:45:02,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:45:02,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:45:02,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:02,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:45:02,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:02,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:45:02,351 INFO L82 PathProgramCache]: Analyzing trace with hash 36423549, now seen corresponding path program 1 times [2018-11-18 12:45:02,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:45:02,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:45:02,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:02,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:45:02,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:45:02,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:45:02,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:45:02,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:45:02,404 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:45:02,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:45:02,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:45:02,407 INFO L87 Difference]: Start difference. First operand 28 states and 41 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-11-18 12:45:02,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:45:02,452 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2018-11-18 12:45:02,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:45:02,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 63 transitions. [2018-11-18 12:45:02,454 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-11-18 12:45:02,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 34 states and 45 transitions. [2018-11-18 12:45:02,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-18 12:45:02,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-18 12:45:02,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 45 transitions. [2018-11-18 12:45:02,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:45:02,455 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2018-11-18 12:45:02,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 45 transitions. [2018-11-18 12:45:02,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 16. [2018-11-18 12:45:02,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 12:45:02,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-11-18 12:45:02,457 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-18 12:45:02,457 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-18 12:45:02,457 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 12:45:02,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2018-11-18 12:45:02,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 12:45:02,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:45:02,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:45:02,458 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 12:45:02,458 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 12:45:02,459 INFO L794 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 279#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;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); 280#L559-2 assume true; 287#L555-1 [2018-11-18 12:45:02,459 INFO L796 eck$LassoCheckResult]: Loop: 287#L555-1 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; 281#L555-2 assume test_fun_#t~short7; 282#L555-4 assume !!test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 290#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); 292#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; 286#L559-2 assume true; 287#L555-1 [2018-11-18 12:45:02,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:45:02,459 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 2 times [2018-11-18 12:45:02,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:45:02,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:45:02,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:02,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:45:02,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:02,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:45:02,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1127285556, now seen corresponding path program 1 times [2018-11-18 12:45:02,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:45:02,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:45:02,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:02,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:45:02,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:45:02,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:45:02,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:45:02,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:45:02,501 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:45:02,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:45:02,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:45:02,502 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-18 12:45:02,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:45:02,539 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-11-18 12:45:02,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:45:02,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2018-11-18 12:45:02,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 12:45:02,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 17 transitions. [2018-11-18 12:45:02,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 12:45:02,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 12:45:02,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-11-18 12:45:02,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:45:02,542 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-18 12:45:02,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-11-18 12:45:02,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-18 12:45:02,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 12:45:02,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-11-18 12:45:02,543 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-18 12:45:02,543 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-18 12:45:02,543 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 12:45:02,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2018-11-18 12:45:02,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 12:45:02,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:45:02,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:45:02,544 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 12:45:02,544 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 12:45:02,545 INFO L794 eck$LassoCheckResult]: Stem: 327#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 321#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;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); 322#L559-2 assume true; 329#L555-1 [2018-11-18 12:45:02,545 INFO L796 eck$LassoCheckResult]: Loop: 329#L555-1 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; 323#L555-2 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; 324#L555-4 assume !!test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 332#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); 334#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; 328#L559-2 assume true; 329#L555-1 [2018-11-18 12:45:02,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:45:02,545 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 3 times [2018-11-18 12:45:02,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:45:02,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:45:02,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:02,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:45:02,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:02,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:45:02,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1129132598, now seen corresponding path program 1 times [2018-11-18 12:45:02,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:45:02,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:45:02,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:02,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:45:02,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:02,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:45:02,569 INFO L82 PathProgramCache]: Analyzing trace with hash 265823576, now seen corresponding path program 1 times [2018-11-18 12:45:02,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:45:02,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:45:02,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:02,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:45:02,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:02,881 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-11-18 12:45:02,957 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:45:02,958 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:45:02,958 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:45:02,958 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:45:02,958 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:45:02,958 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:45:02,958 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:45:02,958 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:45:02,958 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.12-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2018-11-18 12:45:02,958 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:45:02,958 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:45:02,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:02,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:02,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:02,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:02,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:02,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:02,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:02,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:02,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:02,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:02,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:02,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:02,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:02,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:02,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:02,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:02,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:03,144 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2018-11-18 12:45:03,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:03,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:45:03,448 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:45:03,448 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:45:03,448 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-11-18 12:45:03,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:03,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:45:03,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:03,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:03,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:03,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:45:03,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:45:03,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:03,450 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-11-18 12:45:03,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:03,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:03,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:03,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:03,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:03,455 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:03,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:03,457 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-11-18 12:45:03,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:03,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:45:03,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:03,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:03,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:03,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:45:03,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:45:03,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:03,459 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-11-18 12:45:03,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:03,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:45:03,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:03,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:03,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:03,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:45:03,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:45:03,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:03,460 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-11-18 12:45:03,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:03,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:03,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:03,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:03,462 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:03,462 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:03,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:03,464 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-11-18 12:45:03,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:03,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:45:03,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:03,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:03,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:03,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:45:03,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:45:03,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:03,466 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-11-18 12:45:03,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:03,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:45:03,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:03,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:03,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:03,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:45:03,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:45:03,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:03,467 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-11-18 12:45:03,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:03,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:03,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:03,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:03,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:03,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:03,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:03,470 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-11-18 12:45:03,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:03,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:03,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:03,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:03,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:03,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:03,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:03,474 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-11-18 12:45:03,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:03,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:45:03,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:03,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:03,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:03,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:45:03,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:45:03,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:03,476 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-11-18 12:45:03,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:03,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:45:03,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:03,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:03,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:03,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:45:03,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:45:03,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:03,477 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-11-18 12:45:03,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:03,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:03,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:03,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:03,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:03,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:03,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:03,480 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-11-18 12:45:03,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:03,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:45:03,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:03,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:03,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:03,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:45:03,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:45:03,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:03,482 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-11-18 12:45:03,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:03,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:45:03,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:03,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:03,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:03,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:45:03,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:45:03,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:03,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:45:03,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:03,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:03,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:03,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:03,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:03,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:03,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:03,487 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-11-18 12:45:03,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:03,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:03,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:03,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:03,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:03,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:03,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:03,491 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-11-18 12:45:03,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:03,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:03,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:03,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:03,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:03,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:03,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:03,494 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-11-18 12:45:03,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:03,495 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:45:03,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:03,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:03,496 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:45:03,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:03,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:03,499 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-11-18 12:45:03,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:03,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:03,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:03,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:03,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:03,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:03,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:03,504 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-11-18 12:45:03,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:03,504 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:45:03,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:03,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:03,505 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:45:03,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:03,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:03,510 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-11-18 12:45:03,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:03,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:03,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:03,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:03,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:03,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:03,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:03,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:45:03,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:03,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:03,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:03,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:03,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:03,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:03,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:03,517 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-11-18 12:45:03,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:03,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:03,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:03,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:03,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:03,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:03,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:03,520 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-11-18 12:45:03,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:03,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:03,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:03,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:03,523 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:03,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:03,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:03,532 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-11-18 12:45:03,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:03,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:03,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:03,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:03,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:03,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:03,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:03,538 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-11-18 12:45:03,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:03,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:03,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:03,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:03,540 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:03,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:03,545 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:45:03,550 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 12:45:03,550 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 12:45:03,550 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:45:03,551 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:45:03,551 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:45:03,551 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-11-18 12:45:03,605 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-18 12:45:03,608 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:45:03,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:45:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:45:03,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:45:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:45:03,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:45:03,689 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:03,694 INFO L477 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-11-18 12:45:03,701 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:03,702 INFO L477 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-11-18 12:45:03,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:03,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:03,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:03,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-11-18 12:45:03,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:45:03,744 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-11-18 12:45:03,744 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-18 12:45:03,775 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 37 states and 44 transitions. Complement of second has 8 states. [2018-11-18 12:45:03,776 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-11-18 12:45:03,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 12:45:03,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-18 12:45:03,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-18 12:45:03,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:45:03,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-18 12:45:03,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:45:03,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 3 letters. Loop has 12 letters. [2018-11-18 12:45:03,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:45:03,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2018-11-18 12:45:03,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 12:45:03,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 44 transitions. [2018-11-18 12:45:03,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 12:45:03,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-18 12:45:03,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 44 transitions. [2018-11-18 12:45:03,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:45:03,779 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-18 12:45:03,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 44 transitions. [2018-11-18 12:45:03,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2018-11-18 12:45:03,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 12:45:03,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2018-11-18 12:45:03,781 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-18 12:45:03,782 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-18 12:45:03,782 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 12:45:03,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2018-11-18 12:45:03,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 12:45:03,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:45:03,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:45:03,783 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 12:45:03,783 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 12:45:03,783 INFO L794 eck$LassoCheckResult]: Stem: 513#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 507#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;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); 508#L559-2 assume true; 531#L555-1 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; 509#L555-2 [2018-11-18 12:45:03,783 INFO L796 eck$LassoCheckResult]: Loop: 509#L555-2 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; 510#L555-4 assume !!test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 518#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); 520#L559 assume !(test_fun_#t~mem10 > 0);havoc test_fun_#t~mem10; 514#L559-2 assume true; 515#L555-1 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; 509#L555-2 [2018-11-18 12:45:03,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:45:03,783 INFO L82 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2018-11-18 12:45:03,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:45:03,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:45:03,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:03,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:45:03,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:03,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:45:03,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1277972590, now seen corresponding path program 1 times [2018-11-18 12:45:03,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:45:03,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:45:03,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:03,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:45:03,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:45:03,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:45:03,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:45:03,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:45:03,821 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:45:03,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:45:03,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:45:03,821 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-18 12:45:03,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:45:03,840 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-18 12:45:03,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:45:03,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2018-11-18 12:45:03,840 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:45:03,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2018-11-18 12:45:03,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 12:45:03,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 12:45:03,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 12:45:03,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:45:03,841 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:45:03,841 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:45:03,841 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:45:03,841 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 12:45:03,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 12:45:03,841 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:45:03,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 12:45:03,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 12:45:03 BoogieIcfgContainer [2018-11-18 12:45:03,846 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 12:45:03,846 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:45:03,846 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:45:03,846 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:45:03,847 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:45:00" (3/4) ... [2018-11-18 12:45:03,849 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 12:45:03,849 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:45:03,850 INFO L168 Benchmark]: Toolchain (without parser) took 3735.13 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 231.7 MB). Free memory was 956.6 MB in the beginning and 929.4 MB in the end (delta: 27.1 MB). Peak memory consumption was 258.9 MB. Max. memory is 11.5 GB. [2018-11-18 12:45:03,850 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:45:03,850 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -188.3 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. [2018-11-18 12:45:03,851 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-18 12:45:03,851 INFO L168 Benchmark]: Boogie Preprocessor took 14.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-18 12:45:03,852 INFO L168 Benchmark]: RCFGBuilder took 192.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-18 12:45:03,852 INFO L168 Benchmark]: BuchiAutomizer took 3140.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 929.4 MB in the end (delta: 190.6 MB). Peak memory consumption was 267.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:45:03,853 INFO L168 Benchmark]: Witness Printer took 3.00 ms. Allocated memory is still 1.3 GB. Free memory is still 929.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:45:03,855 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 354.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -188.3 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 192.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3140.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 929.4 MB in the end (delta: 190.6 MB). Peak memory consumption was 267.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.00 ms. Allocated memory is still 1.3 GB. Free memory is still 929.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * 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.1s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 2.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 27 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 42 SDtfs, 64 SDslu, 45 SDs, 0 SdLazy, 105 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital238 mio100 ax107 hnf100 lsp89 ukn63 mio100 lsp33 div100 bol100 ite100 ukn100 eq190 hnf88 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms 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...