./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_faf2d7c4-221f-4a1c-9768-8aefebd5ef7e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_faf2d7c4-221f-4a1c-9768-8aefebd5ef7e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_faf2d7c4-221f-4a1c-9768-8aefebd5ef7e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_faf2d7c4-221f-4a1c-9768-8aefebd5ef7e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_faf2d7c4-221f-4a1c-9768-8aefebd5ef7e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_faf2d7c4-221f-4a1c-9768-8aefebd5ef7e/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 abee338f12eaa8176313da7ed567414f687b7fa7 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 02:39:26,733 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 02:39:26,734 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 02:39:26,742 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 02:39:26,742 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 02:39:26,742 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 02:39:26,743 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 02:39:26,744 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 02:39:26,745 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 02:39:26,746 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 02:39:26,746 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 02:39:26,747 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 02:39:26,747 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 02:39:26,748 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 02:39:26,748 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 02:39:26,749 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 02:39:26,750 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 02:39:26,751 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 02:39:26,752 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 02:39:26,753 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 02:39:26,754 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 02:39:26,755 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 02:39:26,756 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 02:39:26,756 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 02:39:26,757 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 02:39:26,757 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 02:39:26,758 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 02:39:26,758 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 02:39:26,759 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 02:39:26,760 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 02:39:26,760 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 02:39:26,760 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 02:39:26,760 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 02:39:26,761 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 02:39:26,761 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 02:39:26,761 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 02:39:26,762 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_faf2d7c4-221f-4a1c-9768-8aefebd5ef7e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 02:39:26,773 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 02:39:26,773 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 02:39:26,774 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 02:39:26,774 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 02:39:26,774 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 02:39:26,774 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 02:39:26,774 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 02:39:26,775 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 02:39:26,775 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 02:39:26,775 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 02:39:26,775 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 02:39:26,775 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 02:39:26,775 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 02:39:26,775 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 02:39:26,775 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 02:39:26,776 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 02:39:26,776 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 02:39:26,776 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 02:39:26,776 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 02:39:26,776 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 02:39:26,776 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 02:39:26,776 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 02:39:26,777 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 02:39:26,777 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 02:39:26,777 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 02:39:26,777 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 02:39:26,777 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 02:39:26,777 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 02:39:26,778 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 02:39:26,778 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_faf2d7c4-221f-4a1c-9768-8aefebd5ef7e/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 -> abee338f12eaa8176313da7ed567414f687b7fa7 [2018-12-02 02:39:26,799 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 02:39:26,807 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 02:39:26,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 02:39:26,810 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 02:39:26,810 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 02:39:26,810 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_faf2d7c4-221f-4a1c-9768-8aefebd5ef7e/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca_true-termination_true-no-overflow.c.i [2018-12-02 02:39:26,845 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_faf2d7c4-221f-4a1c-9768-8aefebd5ef7e/bin-2019/uautomizer/data/9f4b95da2/ec5303e1601e462bbc6de6e0cd772e96/FLAGedc145aa9 [2018-12-02 02:39:27,287 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 02:39:27,288 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_faf2d7c4-221f-4a1c-9768-8aefebd5ef7e/sv-benchmarks/c/termination-memory-alloca/b.18-alloca_true-termination_true-no-overflow.c.i [2018-12-02 02:39:27,294 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_faf2d7c4-221f-4a1c-9768-8aefebd5ef7e/bin-2019/uautomizer/data/9f4b95da2/ec5303e1601e462bbc6de6e0cd772e96/FLAGedc145aa9 [2018-12-02 02:39:27,302 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_faf2d7c4-221f-4a1c-9768-8aefebd5ef7e/bin-2019/uautomizer/data/9f4b95da2/ec5303e1601e462bbc6de6e0cd772e96 [2018-12-02 02:39:27,304 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 02:39:27,305 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 02:39:27,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 02:39:27,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 02:39:27,308 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 02:39:27,309 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:39:27" (1/1) ... [2018-12-02 02:39:27,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58dfd927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:27, skipping insertion in model container [2018-12-02 02:39:27,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:39:27" (1/1) ... [2018-12-02 02:39:27,315 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 02:39:27,338 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 02:39:27,488 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:39:27,494 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 02:39:27,553 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:39:27,578 INFO L195 MainTranslator]: Completed translation [2018-12-02 02:39:27,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:27 WrapperNode [2018-12-02 02:39:27,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 02:39:27,579 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 02:39:27,579 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 02:39:27,579 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 02:39:27,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:27" (1/1) ... [2018-12-02 02:39:27,592 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:27" (1/1) ... [2018-12-02 02:39:27,605 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 02:39:27,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 02:39:27,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 02:39:27,605 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 02:39:27,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:27" (1/1) ... [2018-12-02 02:39:27,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:27" (1/1) ... [2018-12-02 02:39:27,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:27" (1/1) ... [2018-12-02 02:39:27,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:27" (1/1) ... [2018-12-02 02:39:27,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:27" (1/1) ... [2018-12-02 02:39:27,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:27" (1/1) ... [2018-12-02 02:39:27,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:27" (1/1) ... [2018-12-02 02:39:27,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 02:39:27,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 02:39:27,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 02:39:27,620 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 02:39:27,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_faf2d7c4-221f-4a1c-9768-8aefebd5ef7e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 02:39:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 02:39:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 02:39:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 02:39:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 02:39:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 02:39:27,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 02:39:27,789 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 02:39:27,789 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-02 02:39:27,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:39:27 BoogieIcfgContainer [2018-12-02 02:39:27,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 02:39:27,790 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 02:39:27,790 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 02:39:27,792 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 02:39:27,793 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 02:39:27,793 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 02:39:27" (1/3) ... [2018-12-02 02:39:27,794 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52054fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 02:39:27, skipping insertion in model container [2018-12-02 02:39:27,794 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 02:39:27,794 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:39:27" (2/3) ... [2018-12-02 02:39:27,794 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52054fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 02:39:27, skipping insertion in model container [2018-12-02 02:39:27,794 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 02:39:27,794 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:39:27" (3/3) ... [2018-12-02 02:39:27,795 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.18-alloca_true-termination_true-no-overflow.c.i [2018-12-02 02:39:27,825 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 02:39:27,825 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 02:39:27,825 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 02:39:27,825 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 02:39:27,826 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 02:39:27,826 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 02:39:27,826 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 02:39:27,826 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 02:39:27,826 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 02:39:27,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-12-02 02:39:27,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 02:39:27,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:39:27,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:39:27,857 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 02:39:27,857 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 02:39:27,858 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 02:39:27,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-12-02 02:39:27,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 02:39:27,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:39:27,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:39:27,859 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 02:39:27,860 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 02:39:27,865 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, 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_~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 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); 8#L559-4true [2018-12-02 02:39:27,865 INFO L796 eck$LassoCheckResult]: Loop: 8#L559-4true call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 14#L553-1true assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 18#L553-3true assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~short6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 9#L554true assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 6#L559-3true assume !true; 8#L559-4true [2018-12-02 02:39:27,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:27,869 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-02 02:39:27,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:39:27,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:39:27,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:27,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:39:27,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:27,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:27,952 INFO L82 PathProgramCache]: Analyzing trace with hash 35410170, now seen corresponding path program 1 times [2018-12-02 02:39:27,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:39:27,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:39:27,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:27,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:39:27,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:39:27,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:39:27,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:39:27,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-02 02:39:27,979 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 02:39:27,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 02:39:27,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 02:39:27,989 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2018-12-02 02:39:27,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:39:27,993 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2018-12-02 02:39:27,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 02:39:27,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2018-12-02 02:39:27,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 02:39:27,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 10 states and 14 transitions. [2018-12-02 02:39:27,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 02:39:27,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 02:39:27,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2018-12-02 02:39:27,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 02:39:27,999 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2018-12-02 02:39:28,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2018-12-02 02:39:28,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-02 02:39:28,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-02 02:39:28,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2018-12-02 02:39:28,015 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2018-12-02 02:39:28,015 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2018-12-02 02:39:28,015 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 02:39:28,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2018-12-02 02:39:28,016 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 02:39:28,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:39:28,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:39:28,016 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 02:39:28,016 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 02:39:28,017 INFO L794 eck$LassoCheckResult]: Stem: 46#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 42#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, 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_~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 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); 43#L559-4 [2018-12-02 02:39:28,017 INFO L796 eck$LassoCheckResult]: Loop: 43#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 49#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 50#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~short6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 51#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 45#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 44#L559-1 assume !(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; 43#L559-4 [2018-12-02 02:39:28,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:28,017 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-02 02:39:28,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:39:28,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:39:28,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:28,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:39:28,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:28,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:28,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1097715097, now seen corresponding path program 1 times [2018-12-02 02:39:28,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:39:28,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:39:28,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:28,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:39:28,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:39:28,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:39:28,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:39:28,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:39:28,087 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 02:39:28,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:39:28,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:39:28,087 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-12-02 02:39:28,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:39:28,123 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2018-12-02 02:39:28,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:39:28,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2018-12-02 02:39:28,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-12-02 02:39:28,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 23 transitions. [2018-12-02 02:39:28,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 02:39:28,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 02:39:28,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2018-12-02 02:39:28,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 02:39:28,125 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-12-02 02:39:28,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2018-12-02 02:39:28,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-12-02 02:39:28,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-02 02:39:28,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-12-02 02:39:28,126 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-12-02 02:39:28,127 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-12-02 02:39:28,127 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 02:39:28,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2018-12-02 02:39:28,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-02 02:39:28,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:39:28,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:39:28,127 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 02:39:28,127 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 02:39:28,127 INFO L794 eck$LassoCheckResult]: Stem: 83#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 79#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, 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_~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 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); 80#L559-4 [2018-12-02 02:39:28,127 INFO L796 eck$LassoCheckResult]: Loop: 80#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 86#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 87#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~short6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 89#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 84#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 85#L555-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 80#L559-4 [2018-12-02 02:39:28,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:28,128 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-12-02 02:39:28,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:39:28,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:39:28,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:28,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:39:28,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:28,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:28,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1097700202, now seen corresponding path program 1 times [2018-12-02 02:39:28,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:39:28,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:39:28,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:28,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:39:28,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:39:28,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:39:28,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:39:28,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:39:28,164 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 02:39:28,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:39:28,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:39:28,164 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-12-02 02:39:28,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:39:28,190 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-12-02 02:39:28,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:39:28,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-12-02 02:39:28,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-12-02 02:39:28,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2018-12-02 02:39:28,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-02 02:39:28,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-12-02 02:39:28,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-12-02 02:39:28,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 02:39:28,191 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-02 02:39:28,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-12-02 02:39:28,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-12-02 02:39:28,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-02 02:39:28,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-12-02 02:39:28,192 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-12-02 02:39:28,192 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-12-02 02:39:28,192 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 02:39:28,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-12-02 02:39:28,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-12-02 02:39:28,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:39:28,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:39:28,193 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 02:39:28,193 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-02 02:39:28,193 INFO L794 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 116#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, 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_~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 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); 117#L559-4 [2018-12-02 02:39:28,193 INFO L796 eck$LassoCheckResult]: Loop: 117#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 121#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 122#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~short6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 126#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 123#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 124#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 128#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 129#L555-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 117#L559-4 [2018-12-02 02:39:28,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:28,193 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-12-02 02:39:28,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:39:28,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:39:28,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:28,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:39:28,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:28,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:28,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1672057937, now seen corresponding path program 1 times [2018-12-02 02:39:28,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:39:28,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:39:28,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:28,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:39:28,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:39:28,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:39:28,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:39:28,257 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_faf2d7c4-221f-4a1c-9768-8aefebd5ef7e/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:39:28,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:39:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:39:28,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:39:28,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:39:28,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 54 [2018-12-02 02:39:28,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:39:28,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-12-02 02:39:28,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:39:28,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:39:28,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:39:28,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:39:28,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 47 [2018-12-02 02:39:28,384 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 02:39:28,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:39:28,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 02:39:28,405 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:47 [2018-12-02 02:39:28,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-12-02 02:39:28,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-12-02 02:39:28,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:39:28,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:39:28,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-12-02 02:39:28,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-02 02:39:28,457 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:39:28,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-02 02:39:28,464 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 02:39:28,466 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:39:28,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:39:28,473 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:61, output treesize:3 [2018-12-02 02:39:28,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:39:28,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:39:28,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-12-02 02:39:28,489 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 02:39:28,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 02:39:28,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-02 02:39:28,490 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-12-02 02:39:28,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:39:28,650 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2018-12-02 02:39:28,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 02:39:28,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2018-12-02 02:39:28,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-02 02:39:28,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2018-12-02 02:39:28,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-02 02:39:28,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-02 02:39:28,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2018-12-02 02:39:28,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 02:39:28,652 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-12-02 02:39:28,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2018-12-02 02:39:28,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-02 02:39:28,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-02 02:39:28,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-12-02 02:39:28,654 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-12-02 02:39:28,654 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-12-02 02:39:28,654 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 02:39:28,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-12-02 02:39:28,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-02 02:39:28,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:39:28,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:39:28,655 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 02:39:28,655 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-02 02:39:28,655 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 190#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, 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_~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 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); 191#L559-4 [2018-12-02 02:39:28,655 INFO L796 eck$LassoCheckResult]: Loop: 191#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 195#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 196#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~short6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 200#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 201#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 192#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 193#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 199#L559-1 assume !(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; 191#L559-4 [2018-12-02 02:39:28,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:28,655 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-12-02 02:39:28,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:39:28,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:39:28,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:28,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:39:28,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:28,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:28,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1657743362, now seen corresponding path program 1 times [2018-12-02 02:39:28,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:39:28,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:39:28,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:28,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:39:28,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:28,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:28,678 INFO L82 PathProgramCache]: Analyzing trace with hash -967181888, now seen corresponding path program 1 times [2018-12-02 02:39:28,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:39:28,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:39:28,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:28,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:39:28,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:28,932 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 02:39:28,933 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 02:39:28,933 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 02:39:28,933 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 02:39:28,933 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 02:39:28,933 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 02:39:28,933 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 02:39:28,933 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 02:39:28,933 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-12-02 02:39:28,933 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 02:39:28,934 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 02:39:28,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:28,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:28,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:28,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:28,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:28,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:28,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:28,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:28,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:29,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:29,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:29,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:29,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:29,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:29,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:29,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:29,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:29,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:29,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:29,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:29,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:29,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:29,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:29,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:29,306 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 02:39:29,309 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 02:39:29,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:29,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:29,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:29,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:29,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:29,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:29,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:29,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:29,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:29,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:29,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:29,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:29,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:29,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:29,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:29,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:29,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:29,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:29,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:29,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:29,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:29,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:29,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:29,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:29,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:29,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:29,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:29,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:29,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:29,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:29,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:29,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:29,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:29,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:29,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:29,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:29,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:29,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:29,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:29,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:29,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:29,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:39:29,320 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:39:29,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:29,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:29,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:29,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:29,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:29,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:29,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:29,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:29,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:29,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:29,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:29,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:29,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:29,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:29,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:29,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:29,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:29,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:29,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:29,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:29,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:29,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:29,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:29,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:29,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:39:29,326 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:39:29,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:29,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:29,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:29,330 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 02:39:29,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:29,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:29,332 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:39:29,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:39:29,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:29,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:29,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:29,338 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 02:39:29,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:29,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:29,340 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:39:29,340 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:39:29,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:29,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:29,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:29,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:29,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:29,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:29,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:39:29,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:39:29,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:29,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:29,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:29,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:29,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:29,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:29,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:39:29,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:39:29,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:29,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:29,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:29,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:29,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:29,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:29,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:39:29,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:39:29,377 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 02:39:29,390 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 02:39:29,390 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 02:39:29,392 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 02:39:29,392 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 02:39:29,393 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 02:39:29,393 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)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2018-12-02 02:39:29,414 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-12-02 02:39:29,418 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 02:39:29,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:39:29,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:39:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:39:29,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:39:29,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-12-02 02:39:29,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-02 02:39:29,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:39:29,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:39:29,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 02:39:29,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-02 02:39:29,466 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:39:29,467 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:39:29,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:39:29,469 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:6 [2018-12-02 02:39:29,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:39:29,489 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-02 02:39:29,489 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-12-02 02:39:29,567 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 40 states and 53 transitions. Complement of second has 10 states. [2018-12-02 02:39:29,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-02 02:39:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-02 02:39:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-12-02 02:39:29,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 2 letters. Loop has 8 letters. [2018-12-02 02:39:29,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:39:29,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 10 letters. Loop has 8 letters. [2018-12-02 02:39:29,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:39:29,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 2 letters. Loop has 16 letters. [2018-12-02 02:39:29,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:39:29,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 53 transitions. [2018-12-02 02:39:29,572 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-02 02:39:29,572 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 38 states and 51 transitions. [2018-12-02 02:39:29,572 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-12-02 02:39:29,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-02 02:39:29,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 51 transitions. [2018-12-02 02:39:29,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 02:39:29,573 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 51 transitions. [2018-12-02 02:39:29,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 51 transitions. [2018-12-02 02:39:29,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2018-12-02 02:39:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-02 02:39:29,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2018-12-02 02:39:29,575 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2018-12-02 02:39:29,575 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2018-12-02 02:39:29,575 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 02:39:29,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2018-12-02 02:39:29,576 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-02 02:39:29,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:39:29,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:39:29,576 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 02:39:29,577 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1, 1] [2018-12-02 02:39:29,577 INFO L794 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 354#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, 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_~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 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); 355#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 367#L553-1 [2018-12-02 02:39:29,577 INFO L796 eck$LassoCheckResult]: Loop: 367#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 368#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~short6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 371#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 363#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 364#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 373#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 380#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 379#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 378#L555-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 357#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 367#L553-1 [2018-12-02 02:39:29,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:29,577 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-12-02 02:39:29,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:39:29,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:39:29,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:29,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:39:29,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:29,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:29,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1479493138, now seen corresponding path program 2 times [2018-12-02 02:39:29,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:39:29,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:39:29,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:29,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:39:29,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:29,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:29,595 INFO L82 PathProgramCache]: Analyzing trace with hash 376307409, now seen corresponding path program 1 times [2018-12-02 02:39:29,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:39:29,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:39:29,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:29,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:39:29,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:29,825 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2018-12-02 02:39:29,955 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-12-02 02:39:29,957 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 02:39:29,957 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 02:39:29,957 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 02:39:29,957 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 02:39:29,957 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 02:39:29,957 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 02:39:29,957 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 02:39:29,957 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 02:39:29,957 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca_true-termination_true-no-overflow.c.i_Iteration6_Lasso [2018-12-02 02:39:29,957 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 02:39:29,957 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 02:39:29,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:29,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-12-02 02:39:29,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:29,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-12-02 02:39:29,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-12-02 02:39:29,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-12-02 02:39:29,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-12-02 02:39:29,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-12-02 02:39:29,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-12-02 02:39:29,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-12-02 02:39:29,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:29,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-12-02 02:39:30,189 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2018-12-02 02:39:30,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:30,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:30,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:30,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:30,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:30,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:30,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:30,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:30,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:30,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:30,566 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 02:39:30,566 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 02:39:30,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:30,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:30,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:30,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:30,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:30,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:30,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:30,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:30,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:30,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:30,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:30,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:30,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:30,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:30,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:30,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:30,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:30,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:30,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:30,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:30,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:30,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:30,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:30,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:30,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:30,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:30,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:30,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:30,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:30,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:30,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:30,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:30,570 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:39:30,570 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:39:30,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:30,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:30,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:30,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:30,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:30,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:30,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:39:30,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:39:30,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:30,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:30,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:30,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:30,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:30,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:30,575 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:39:30,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:39:30,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:30,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:30,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:30,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:30,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:30,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:30,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:30,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:30,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:30,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:30,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:30,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:30,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:30,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:30,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:30,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:30,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:30,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:30,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:30,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:30,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:30,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:30,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:30,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:30,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:30,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:30,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:30,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:30,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:30,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:30,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:30,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:30,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:30,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:30,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:30,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:30,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:30,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:30,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:30,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:30,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:30,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:30,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:30,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:30,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:30,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:30,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:30,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:30,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:30,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:30,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:30,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:39:30,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:39:30,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:30,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:30,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:30,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:30,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:30,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:30,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:39:30,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:39:30,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:30,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:30,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:30,601 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 02:39:30,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:30,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:30,604 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:39:30,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:39:30,619 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 02:39:30,636 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 02:39:30,636 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-02 02:39:30,636 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 02:39:30,637 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 02:39:30,637 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 02:39:30,637 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)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2018-12-02 02:39:30,657 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-12-02 02:39:30,658 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 02:39:30,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:39:30,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:39:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:39:30,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:39:30,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-12-02 02:39:30,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-12-02 02:39:30,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:39:30,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2018-12-02 02:39:30,733 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 02:39:30,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-12-02 02:39:30,750 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:39:30,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 02:39:30,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:39:30,774 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:21 [2018-12-02 02:39:30,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 02:39:30,806 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-12-02 02:39:30,806 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-12-02 02:39:30,879 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 59 states and 83 transitions. Complement of second has 12 states. [2018-12-02 02:39:30,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-12-02 02:39:30,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 02:39:30,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-12-02 02:39:30,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 3 letters. Loop has 10 letters. [2018-12-02 02:39:30,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:39:30,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 13 letters. Loop has 10 letters. [2018-12-02 02:39:30,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:39:30,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 3 letters. Loop has 20 letters. [2018-12-02 02:39:30,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:39:30,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 83 transitions. [2018-12-02 02:39:30,882 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-02 02:39:30,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 50 states and 70 transitions. [2018-12-02 02:39:30,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-02 02:39:30,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 02:39:30,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 70 transitions. [2018-12-02 02:39:30,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 02:39:30,883 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 70 transitions. [2018-12-02 02:39:30,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 70 transitions. [2018-12-02 02:39:30,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-12-02 02:39:30,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-02 02:39:30,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2018-12-02 02:39:30,885 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 69 transitions. [2018-12-02 02:39:30,885 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 69 transitions. [2018-12-02 02:39:30,885 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 02:39:30,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 69 transitions. [2018-12-02 02:39:30,886 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-02 02:39:30,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:39:30,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:39:30,886 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:39:30,886 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 02:39:30,886 INFO L794 eck$LassoCheckResult]: Stem: 573#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 565#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, 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_~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 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); 566#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 578#L553-1 assume !test_fun_#t~short6; 579#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~short6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 588#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 589#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 609#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 608#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 575#L555-1 [2018-12-02 02:39:30,886 INFO L796 eck$LassoCheckResult]: Loop: 575#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 574#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 575#L555-1 [2018-12-02 02:39:30,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:30,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1272523114, now seen corresponding path program 1 times [2018-12-02 02:39:30,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:39:30,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:39:30,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:30,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:39:30,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:39:30,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:39:30,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:39:30,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:39:30,896 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 02:39:30,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:30,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1948, now seen corresponding path program 1 times [2018-12-02 02:39:30,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:39:30,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:39:30,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:30,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:39:30,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:30,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:39:30,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:39:30,926 INFO L87 Difference]: Start difference. First operand 49 states and 69 transitions. cyclomatic complexity: 27 Second operand 3 states. [2018-12-02 02:39:30,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:39:30,931 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2018-12-02 02:39:30,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:39:30,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 69 transitions. [2018-12-02 02:39:30,933 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-02 02:39:30,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 49 states and 63 transitions. [2018-12-02 02:39:30,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-02 02:39:30,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-02 02:39:30,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 63 transitions. [2018-12-02 02:39:30,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 02:39:30,933 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 63 transitions. [2018-12-02 02:39:30,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 63 transitions. [2018-12-02 02:39:30,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-02 02:39:30,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-02 02:39:30,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2018-12-02 02:39:30,935 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 63 transitions. [2018-12-02 02:39:30,935 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 63 transitions. [2018-12-02 02:39:30,935 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 02:39:30,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 63 transitions. [2018-12-02 02:39:30,936 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-02 02:39:30,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:39:30,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:39:30,936 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:39:30,936 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 02:39:30,936 INFO L794 eck$LassoCheckResult]: Stem: 680#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 672#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, 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_~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 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); 673#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 691#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 703#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~short6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 701#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 699#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 697#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 694#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 689#L559-1 [2018-12-02 02:39:30,936 INFO L796 eck$LassoCheckResult]: Loop: 689#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 688#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 689#L559-1 [2018-12-02 02:39:30,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:30,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1215726572, now seen corresponding path program 1 times [2018-12-02 02:39:30,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:39:30,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:39:30,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:30,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:39:30,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:30,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:30,946 INFO L82 PathProgramCache]: Analyzing trace with hash 2428, now seen corresponding path program 1 times [2018-12-02 02:39:30,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:39:30,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:39:30,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:30,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:39:30,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:30,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:30,950 INFO L82 PathProgramCache]: Analyzing trace with hash 82132647, now seen corresponding path program 2 times [2018-12-02 02:39:30,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:39:30,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:39:30,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:30,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:39:30,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:31,157 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 94 [2018-12-02 02:39:31,207 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 02:39:31,207 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 02:39:31,208 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 02:39:31,208 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 02:39:31,208 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 02:39:31,208 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 02:39:31,208 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 02:39:31,208 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 02:39:31,208 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca_true-termination_true-no-overflow.c.i_Iteration8_Lasso [2018-12-02 02:39:31,208 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 02:39:31,208 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 02:39:31,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:31,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:31,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:31,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:31,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:31,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:31,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:31,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:31,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:31,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:31,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:31,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:31,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:31,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:31,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:31,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:31,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:31,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:31,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:31,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:31,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:31,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:31,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:31,514 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 02:39:31,515 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 02:39:31,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:31,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:31,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:31,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:31,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:31,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:31,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:31,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:31,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:31,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:31,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:31,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:31,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:31,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:31,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:31,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:31,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:31,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:31,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-12-02 02:39:31,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:31,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:31,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:31,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:31,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:39:31,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:39:31,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:31,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:31,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:31,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:31,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:31,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:31,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:31,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:31,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:31,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:31,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-12-02 02:39:31,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:31,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:31,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:31,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:31,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:31,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:31,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:31,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:31,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:31,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:31,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:31,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:31,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:31,521 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:39:31,521 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:39:31,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:31,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:31,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:31,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:31,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:31,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:31,523 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:39:31,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:39:31,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:31,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:31,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:31,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:31,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:31,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:31,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:31,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:31,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:31,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:31,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:31,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:31,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:31,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:31,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:31,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:31,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:31,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:31,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:31,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:31,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:31,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:31,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:31,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:31,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:39:31,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:39:31,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:31,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:31,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:31,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:31,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:31,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:31,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:31,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:31,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:31,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:31,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:31,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:31,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:31,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:31,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:31,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:31,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:31,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:31,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:31,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:31,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:31,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:31,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:31,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:31,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:31,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:31,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:31,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:31,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:31,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:31,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:31,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:31,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:31,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:31,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:31,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:31,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:31,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-12-02 02:39:31,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:31,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:31,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:31,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:31,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:31,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:31,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:31,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:31,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:31,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:31,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:31,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:31,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:31,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:31,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:31,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:31,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:31,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:31,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:31,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:31,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:31,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:31,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:31,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:31,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:31,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:31,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:31,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:31,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:31,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:31,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:31,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:39:31,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:39:31,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:31,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:31,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:31,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:31,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:31,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:31,537 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:39:31,537 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:39:31,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:31,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:31,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:31,539 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 02:39:31,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:31,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:31,540 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:39:31,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:39:31,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:31,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:31,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:31,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:31,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:31,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:31,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:39:31,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:39:31,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:31,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:31,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:31,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:31,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:31,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:31,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:39:31,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:39:31,554 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 02:39:31,560 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-02 02:39:31,561 INFO L444 ModelExtractionUtils]: 23 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 02:39:31,561 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 02:39:31,561 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-02 02:39:31,562 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 02:39:31,562 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_#t~mem11) = 1*ULTIMATE.start_test_fun_#t~mem11 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3 + 1*ULTIMATE.start_test_fun_#t~mem11 >= 0] [2018-12-02 02:39:31,583 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-12-02 02:39:31,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:39:31,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:39:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:39:31,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:39:31,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:39:31,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-02 02:39:31,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:39:31,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-12-02 02:39:31,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:39:31,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:39:31,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:39:31,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:13 [2018-12-02 02:39:31,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:39:31,631 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 02:39:31,631 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 21 Second operand 3 states. [2018-12-02 02:39:31,647 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 21. Second operand 3 states. Result 101 states and 129 transitions. Complement of second has 5 states. [2018-12-02 02:39:31,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 02:39:31,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 02:39:31,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2018-12-02 02:39:31,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-02 02:39:31,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:39:31,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 2 letters. [2018-12-02 02:39:31,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:39:31,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2018-12-02 02:39:31,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:39:31,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 129 transitions. [2018-12-02 02:39:31,649 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 02:39:31,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 92 states and 117 transitions. [2018-12-02 02:39:31,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-02 02:39:31,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-02 02:39:31,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 117 transitions. [2018-12-02 02:39:31,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 02:39:31,649 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 117 transitions. [2018-12-02 02:39:31,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 117 transitions. [2018-12-02 02:39:31,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 68. [2018-12-02 02:39:31,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-02 02:39:31,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2018-12-02 02:39:31,652 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 86 transitions. [2018-12-02 02:39:31,652 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 86 transitions. [2018-12-02 02:39:31,652 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-02 02:39:31,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 86 transitions. [2018-12-02 02:39:31,652 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-02 02:39:31,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:39:31,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:39:31,653 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:39:31,653 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 02:39:31,653 INFO L794 eck$LassoCheckResult]: Stem: 932#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 925#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, 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_~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 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); 926#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 937#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 938#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~short6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 943#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 980#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 975#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 974#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 934#L555-1 [2018-12-02 02:39:31,653 INFO L796 eck$LassoCheckResult]: Loop: 934#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 933#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 934#L555-1 [2018-12-02 02:39:31,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:31,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1215264812, now seen corresponding path program 1 times [2018-12-02 02:39:31,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:39:31,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:39:31,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:31,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:39:31,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:31,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:31,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1948, now seen corresponding path program 2 times [2018-12-02 02:39:31,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:39:31,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:39:31,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:31,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:39:31,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:31,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:31,664 INFO L82 PathProgramCache]: Analyzing trace with hash -361619193, now seen corresponding path program 2 times [2018-12-02 02:39:31,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:39:31,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:39:31,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:31,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:39:31,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:31,888 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2018-12-02 02:39:31,952 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 02:39:31,952 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 02:39:31,952 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 02:39:31,952 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 02:39:31,952 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 02:39:31,952 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 02:39:31,952 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 02:39:31,952 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 02:39:31,952 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca_true-termination_true-no-overflow.c.i_Iteration9_Lasso [2018-12-02 02:39:31,952 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 02:39:31,952 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 02:39:31,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:31,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:31,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:31,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:32,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:32,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:32,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:32,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:32,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:32,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:32,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:32,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:32,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:32,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:32,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:32,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:32,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:32,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:32,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:32,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:32,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:32,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:39:32,283 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 02:39:32,283 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 02:39:32,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:32,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:32,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:32,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:32,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:32,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:32,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:32,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:32,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:32,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:32,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:32,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:32,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:32,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:32,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:32,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:32,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:32,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:32,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:32,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:32,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:39:32,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:32,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:32,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:32,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:39:32,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:39:32,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:39:32,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:39:32,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:39:32,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:39:32,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:39:32,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:39:32,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:39:32,288 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:39:32,301 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 02:39:32,310 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 02:39:32,310 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 02:39:32,310 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 02:39:32,311 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-02 02:39:32,311 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 02:39:32,312 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)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_4 Supporting invariants [-1*ULTIMATE.start_test_fun_#t~mem9 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_4 >= 0] [2018-12-02 02:39:32,339 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-12-02 02:39:32,340 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 02:39:32,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:39:32,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:39:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:39:32,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:39:32,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:39:32,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-02 02:39:32,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:39:32,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-02 02:39:32,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:39:32,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:39:32,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:39:32,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-12-02 02:39:32,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:39:32,386 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 02:39:32,386 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 86 transitions. cyclomatic complexity: 27 Second operand 3 states. [2018-12-02 02:39:32,413 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 86 transitions. cyclomatic complexity: 27. Second operand 3 states. Result 140 states and 174 transitions. Complement of second has 6 states. [2018-12-02 02:39:32,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states [2018-12-02 02:39:32,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 02:39:32,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-12-02 02:39:32,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-02 02:39:32,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:39:32,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2018-12-02 02:39:32,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:39:32,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2018-12-02 02:39:32,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:39:32,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 174 transitions. [2018-12-02 02:39:32,415 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 02:39:32,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 130 states and 163 transitions. [2018-12-02 02:39:32,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-02 02:39:32,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-02 02:39:32,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 163 transitions. [2018-12-02 02:39:32,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 02:39:32,416 INFO L705 BuchiCegarLoop]: Abstraction has 130 states and 163 transitions. [2018-12-02 02:39:32,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 163 transitions. [2018-12-02 02:39:32,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 110. [2018-12-02 02:39:32,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-02 02:39:32,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 141 transitions. [2018-12-02 02:39:32,420 INFO L728 BuchiCegarLoop]: Abstraction has 110 states and 141 transitions. [2018-12-02 02:39:32,420 INFO L608 BuchiCegarLoop]: Abstraction has 110 states and 141 transitions. [2018-12-02 02:39:32,420 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-02 02:39:32,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 141 transitions. [2018-12-02 02:39:32,420 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-02 02:39:32,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:39:32,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:39:32,421 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1] [2018-12-02 02:39:32,421 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 02:39:32,421 INFO L794 eck$LassoCheckResult]: Stem: 1248#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1241#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, 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_~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 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); 1242#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 1261#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 1252#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~short6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1260#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 1264#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1246#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 1247#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1259#L559-1 assume !(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; 1262#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 1263#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 1318#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~short6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1317#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 1316#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1315#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 1311#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1258#L559-1 [2018-12-02 02:39:32,421 INFO L796 eck$LassoCheckResult]: Loop: 1258#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 1257#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1258#L559-1 [2018-12-02 02:39:32,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:32,422 INFO L82 PathProgramCache]: Analyzing trace with hash -2055714993, now seen corresponding path program 2 times [2018-12-02 02:39:32,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:39:32,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:39:32,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:32,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:39:32,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:39:32,448 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 02:39:32,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:39:32,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:39:32,449 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 02:39:32,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:32,449 INFO L82 PathProgramCache]: Analyzing trace with hash 2428, now seen corresponding path program 2 times [2018-12-02 02:39:32,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:39:32,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:39:32,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:32,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:39:32,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:32,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:39:32,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:39:32,476 INFO L87 Difference]: Start difference. First operand 110 states and 141 transitions. cyclomatic complexity: 47 Second operand 5 states. [2018-12-02 02:39:32,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:39:32,501 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2018-12-02 02:39:32,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:39:32,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 105 transitions. [2018-12-02 02:39:32,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 02:39:32,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 24 states and 27 transitions. [2018-12-02 02:39:32,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-12-02 02:39:32,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-12-02 02:39:32,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2018-12-02 02:39:32,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 02:39:32,502 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-12-02 02:39:32,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2018-12-02 02:39:32,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-02 02:39:32,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-02 02:39:32,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-12-02 02:39:32,503 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-12-02 02:39:32,503 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-12-02 02:39:32,503 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-02 02:39:32,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2018-12-02 02:39:32,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 02:39:32,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:39:32,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:39:32,504 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 3, 2, 2, 2, 2, 1, 1, 1] [2018-12-02 02:39:32,504 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 02:39:32,504 INFO L794 eck$LassoCheckResult]: Stem: 1451#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1449#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, 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_~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 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); 1450#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 1456#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 1457#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~short6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1463#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 1464#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1462#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 1454#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1455#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 1472#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1467#L555-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 1461#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 1458#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 1459#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~short6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1460#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 1469#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1468#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 1465#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1453#L555-1 [2018-12-02 02:39:32,504 INFO L796 eck$LassoCheckResult]: Loop: 1453#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 1452#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1453#L555-1 [2018-12-02 02:39:32,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:32,504 INFO L82 PathProgramCache]: Analyzing trace with hash -2121929575, now seen corresponding path program 2 times [2018-12-02 02:39:32,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:39:32,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:39:32,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:32,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:39:32,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:39:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 02:39:32,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:39:32,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:39:32,521 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 02:39:32,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:39:32,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1948, now seen corresponding path program 3 times [2018-12-02 02:39:32,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:39:32,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:39:32,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:32,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:39:32,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:39:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:39:32,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:39:32,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:39:32,541 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-12-02 02:39:32,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:39:32,559 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-02 02:39:32,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:39:32,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 14 transitions. [2018-12-02 02:39:32,559 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 02:39:32,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2018-12-02 02:39:32,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 02:39:32,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 02:39:32,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 02:39:32,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 02:39:32,560 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 02:39:32,560 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 02:39:32,560 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 02:39:32,560 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-02 02:39:32,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 02:39:32,560 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 02:39:32,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 02:39:32,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 02:39:32 BoogieIcfgContainer [2018-12-02 02:39:32,564 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 02:39:32,564 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 02:39:32,564 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 02:39:32,565 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 02:39:32,565 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:39:27" (3/4) ... [2018-12-02 02:39:32,567 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 02:39:32,567 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 02:39:32,568 INFO L168 Benchmark]: Toolchain (without parser) took 5263.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.6 MB). Free memory was 951.7 MB in the beginning and 1.0 GB in the end (delta: -92.7 MB). Peak memory consumption was 124.8 MB. Max. memory is 11.5 GB. [2018-12-02 02:39:32,568 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:39:32,568 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -144.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-02 02:39:32,569 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 02:39:32,569 INFO L168 Benchmark]: Boogie Preprocessor took 14.30 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:39:32,569 INFO L168 Benchmark]: RCFGBuilder took 170.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-02 02:39:32,569 INFO L168 Benchmark]: BuchiAutomizer took 4774.05 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 110.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 129.7 MB. Max. memory is 11.5 GB. [2018-12-02 02:39:32,570 INFO L168 Benchmark]: Witness Printer took 2.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. [2018-12-02 02:39:32,571 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 273.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -144.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.30 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 170.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4774.05 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 110.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 129.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (7 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 7 locations. One deterministic module has affine ranking function org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@704bf6c and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 4 locations. 7 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.7s and 12 iterations. TraceHistogramMax:5. Analysis of lassos took 3.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 59 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 110 states and ocurred in iteration 9. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 8/8 HoareTripleCheckerStatistics: 115 SDtfs, 83 SDslu, 103 SDs, 0 SdLazy, 256 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT0 conc0 concLT0 SILN0 SILU3 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital260 mio100 ax107 hnf99 lsp82 ukn69 mio100 lsp35 div100 bol103 ite100 ukn100 eq178 hnf89 smp96 dnf138 smp89 tf100 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 2 VariablesLoop: 2 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...