./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.13-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0314856b-3418-4320-91c9-d6964a81efb1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0314856b-3418-4320-91c9-d6964a81efb1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0314856b-3418-4320-91c9-d6964a81efb1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0314856b-3418-4320-91c9-d6964a81efb1/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.13-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0314856b-3418-4320-91c9-d6964a81efb1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0314856b-3418-4320-91c9-d6964a81efb1/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 72925b65ef321f719f00e79529e35268c3f3eaa3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:36:40,843 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:36:40,845 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:36:40,852 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:36:40,853 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:36:40,853 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:36:40,854 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:36:40,855 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:36:40,856 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:36:40,857 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:36:40,857 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:36:40,858 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:36:40,858 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:36:40,859 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:36:40,859 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:36:40,860 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:36:40,860 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:36:40,861 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:36:40,862 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:36:40,863 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:36:40,864 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:36:40,865 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:36:40,866 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:36:40,866 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:36:40,867 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:36:40,867 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:36:40,868 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:36:40,869 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:36:40,869 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:36:40,870 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:36:40,870 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:36:40,870 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:36:40,871 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:36:40,871 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:36:40,871 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:36:40,872 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:36:40,872 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0314856b-3418-4320-91c9-d6964a81efb1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 11:36:40,882 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:36:40,883 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:36:40,883 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:36:40,884 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:36:40,884 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:36:40,884 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 11:36:40,884 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 11:36:40,884 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 11:36:40,884 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 11:36:40,884 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 11:36:40,884 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 11:36:40,885 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:36:40,885 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:36:40,885 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:36:40,885 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:36:40,885 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 11:36:40,885 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 11:36:40,885 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 11:36:40,885 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:36:40,885 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 11:36:40,886 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:36:40,886 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 11:36:40,886 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:36:40,886 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:36:40,886 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 11:36:40,886 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:36:40,886 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:36:40,886 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 11:36:40,887 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 11:36:40,887 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_0314856b-3418-4320-91c9-d6964a81efb1/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 -> 72925b65ef321f719f00e79529e35268c3f3eaa3 [2018-11-28 11:36:40,909 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:36:40,917 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:36:40,919 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:36:40,920 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:36:40,920 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:36:40,920 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0314856b-3418-4320-91c9-d6964a81efb1/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.13-alloca_true-termination_true-no-overflow.c.i [2018-11-28 11:36:40,956 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0314856b-3418-4320-91c9-d6964a81efb1/bin-2019/uautomizer/data/5fd3314b9/b08c1c458fa84dd8bd32db1d3b2c4f14/FLAG4b5b3e90a [2018-11-28 11:36:41,407 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:36:41,408 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0314856b-3418-4320-91c9-d6964a81efb1/sv-benchmarks/c/termination-memory-alloca/b.13-alloca_true-termination_true-no-overflow.c.i [2018-11-28 11:36:41,417 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0314856b-3418-4320-91c9-d6964a81efb1/bin-2019/uautomizer/data/5fd3314b9/b08c1c458fa84dd8bd32db1d3b2c4f14/FLAG4b5b3e90a [2018-11-28 11:36:41,428 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0314856b-3418-4320-91c9-d6964a81efb1/bin-2019/uautomizer/data/5fd3314b9/b08c1c458fa84dd8bd32db1d3b2c4f14 [2018-11-28 11:36:41,430 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:36:41,430 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:36:41,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:36:41,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:36:41,433 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:36:41,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:36:41" (1/1) ... [2018-11-28 11:36:41,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b810661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:36:41, skipping insertion in model container [2018-11-28 11:36:41,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:36:41" (1/1) ... [2018-11-28 11:36:41,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:36:41,464 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:36:41,640 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:36:41,693 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:36:41,717 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:36:41,747 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:36:41,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:36:41 WrapperNode [2018-11-28 11:36:41,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:36:41,749 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:36:41,749 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:36:41,749 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:36:41,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:36:41" (1/1) ... [2018-11-28 11:36:41,763 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:36:41" (1/1) ... [2018-11-28 11:36:41,776 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:36:41,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:36:41,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:36:41,777 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:36:41,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:36:41" (1/1) ... [2018-11-28 11:36:41,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:36:41" (1/1) ... [2018-11-28 11:36:41,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:36:41" (1/1) ... [2018-11-28 11:36:41,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:36:41" (1/1) ... [2018-11-28 11:36:41,788 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:36:41" (1/1) ... [2018-11-28 11:36:41,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:36:41" (1/1) ... [2018-11-28 11:36:41,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:36:41" (1/1) ... [2018-11-28 11:36:41,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:36:41,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:36:41,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:36:41,795 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:36:41,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:36:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0314856b-3418-4320-91c9-d6964a81efb1/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:36:41,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:36:41,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:36:41,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:36:41,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:36:41,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:36:41,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:36:42,013 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:36:42,013 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 11:36:42,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:36:42 BoogieIcfgContainer [2018-11-28 11:36:42,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:36:42,014 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 11:36:42,014 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 11:36:42,017 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 11:36:42,018 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:36:42,018 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:36:41" (1/3) ... [2018-11-28 11:36:42,019 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77f7d914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:36:42, skipping insertion in model container [2018-11-28 11:36:42,019 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:36:42,019 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:36:41" (2/3) ... [2018-11-28 11:36:42,019 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77f7d914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:36:42, skipping insertion in model container [2018-11-28 11:36:42,019 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:36:42,020 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:36:42" (3/3) ... [2018-11-28 11:36:42,021 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.13-alloca_true-termination_true-no-overflow.c.i [2018-11-28 11:36:42,060 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:36:42,060 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 11:36:42,060 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 11:36:42,060 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 11:36:42,061 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:36:42,061 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:36:42,061 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 11:36:42,061 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:36:42,061 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 11:36:42,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 11:36:42,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 11:36:42,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:36:42,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:36:42,089 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:36:42,089 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:36:42,089 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 11:36:42,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 11:36:42,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 11:36:42,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:36:42,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:36:42,091 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:36:42,091 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:36:42,096 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 14#L561-2true [2018-11-28 11:36:42,096 INFO L796 eck$LassoCheckResult]: Loop: 14#L561-2true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 8#L557-1true assume test_fun_#t~short10; 12#L557-3true assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 4#L558true assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; 14#L561-2true [2018-11-28 11:36:42,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:42,100 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 11:36:42,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:42,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:42,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:42,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:36:42,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:42,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:42,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 1 times [2018-11-28 11:36:42,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:42,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:42,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:42,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:36:42,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:42,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:42,227 INFO L82 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2018-11-28 11:36:42,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:42,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:42,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:42,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:36:42,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:42,378 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-11-28 11:36:42,810 WARN L180 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 108 [2018-11-28 11:36:42,991 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-11-28 11:36:43,002 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:36:43,003 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:36:43,003 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:36:43,003 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:36:43,003 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:36:43,004 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:36:43,004 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:36:43,004 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:36:43,004 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.13-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-11-28 11:36:43,004 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:36:43,004 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:36:43,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:43,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:43,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:43,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:43,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:43,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:43,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:43,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:43,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:43,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:43,401 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 93 [2018-11-28 11:36:43,524 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2018-11-28 11:36:43,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:43,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:43,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:43,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:43,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:43,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:43,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:43,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:43,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:43,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:43,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:43,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:43,915 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:36:43,918 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:36:43,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:43,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:43,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:43,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:43,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:43,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:36:43,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:43,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:43,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:43,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:43,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:36:43,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:43,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:43,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:43,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:36:43,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:36:43,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:43,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:43,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:43,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:36:43,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:43,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:43,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:43,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:36:43,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:36:43,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:43,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:43,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:43,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:36:43,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:43,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:43,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:43,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:36:43,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:36:43,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:43,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:43,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:43,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:36:43,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:43,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:43,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:43,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:36:43,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:36:43,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:43,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:43,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:43,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:36:43,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:43,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:43,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:43,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:36:43,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:36:43,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:43,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:43,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:43,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:43,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:43,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:43,941 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:36:43,941 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:43,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:43,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:43,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:43,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:36:43,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:43,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:43,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:43,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:36:43,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:36:43,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:43,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:43,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:43,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:36:43,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:43,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:43,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:43,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:36:43,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:36:43,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:43,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:43,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:43,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:43,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:43,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:43,950 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:36:43,950 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:43,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:43,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:43,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:43,953 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:36:43,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:43,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:43,955 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:36:43,955 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:43,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:43,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:43,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:43,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:43,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:43,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:43,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:36:43,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:43,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:43,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:43,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:43,975 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:36:43,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:43,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:43,976 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:36:43,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:43,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:43,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:43,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:43,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:43,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:43,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:43,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:36:43,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:43,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:43,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:43,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:43,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:43,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:43,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:43,994 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:36:43,994 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:43,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:43,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:43,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:43,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:43,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:43,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:43,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:36:43,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:44,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:44,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:44,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:44,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:44,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:44,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:44,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:36:44,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:44,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:44,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:44,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:44,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:44,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:44,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:44,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:36:44,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:44,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:44,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:44,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:44,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:44,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:44,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:44,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:36:44,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:44,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:44,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:44,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:44,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:44,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:44,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:44,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:36:44,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:44,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:44,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:44,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:44,025 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:36:44,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:44,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:44,026 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:36:44,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:44,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:44,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:44,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:44,032 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:36:44,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:44,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:44,033 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:36:44,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:44,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:44,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:44,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:44,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:44,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:44,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:44,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:36:44,043 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:44,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:44,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:44,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:44,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:44,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:44,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:44,061 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:36:44,061 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:44,074 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:36:44,082 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:36:44,082 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:36:44,084 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:36:44,085 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:36:44,085 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:36:44,086 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-11-28 11:36:44,218 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2018-11-28 11:36:44,224 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:36:44,225 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:36:44,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:36:44,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:36:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:36:44,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:36:44,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:36:44,377 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 11:36:44,379 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 4 states. [2018-11-28 11:36:44,480 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 4 states. Result 60 states and 79 transitions. Complement of second has 10 states. [2018-11-28 11:36:44,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 11:36:44,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:36:44,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2018-11-28 11:36:44,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-28 11:36:44,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:36:44,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 11:36:44,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:36:44,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-28 11:36:44,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:36:44,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. [2018-11-28 11:36:44,490 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2018-11-28 11:36:44,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 30 states and 45 transitions. [2018-11-28 11:36:44,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-28 11:36:44,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-28 11:36:44,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 45 transitions. [2018-11-28 11:36:44,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:36:44,495 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 45 transitions. [2018-11-28 11:36:44,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 45 transitions. [2018-11-28 11:36:44,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-28 11:36:44,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 11:36:44,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2018-11-28 11:36:44,518 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2018-11-28 11:36:44,518 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2018-11-28 11:36:44,518 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 11:36:44,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 43 transitions. [2018-11-28 11:36:44,519 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2018-11-28 11:36:44,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:36:44,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:36:44,519 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 11:36:44,519 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:36:44,519 INFO L794 eck$LassoCheckResult]: Stem: 289#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 282#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 283#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 302#L557-1 [2018-11-28 11:36:44,520 INFO L796 eck$LassoCheckResult]: Loop: 302#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 299#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 300#L558 assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; 296#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 302#L557-1 [2018-11-28 11:36:44,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:44,520 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-28 11:36:44,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:44,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:44,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:44,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:36:44,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:44,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:44,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1298969, now seen corresponding path program 1 times [2018-11-28 11:36:44,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:44,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:44,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:44,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:36:44,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:44,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:44,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1806908732, now seen corresponding path program 1 times [2018-11-28 11:36:44,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:44,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:44,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:44,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:36:44,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:36:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:36:44,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:36:44,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:36:44,730 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2018-11-28 11:36:44,924 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2018-11-28 11:36:44,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:36:44,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:36:44,927 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. cyclomatic complexity: 18 Second operand 5 states. [2018-11-28 11:36:44,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:36:44,967 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2018-11-28 11:36:44,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:36:44,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 65 transitions. [2018-11-28 11:36:44,969 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 25 [2018-11-28 11:36:44,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 36 states and 51 transitions. [2018-11-28 11:36:44,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-28 11:36:44,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-28 11:36:44,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 51 transitions. [2018-11-28 11:36:44,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:36:44,970 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 51 transitions. [2018-11-28 11:36:44,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 51 transitions. [2018-11-28 11:36:44,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 19. [2018-11-28 11:36:44,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 11:36:44,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2018-11-28 11:36:44,972 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2018-11-28 11:36:44,972 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2018-11-28 11:36:44,972 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 11:36:44,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2018-11-28 11:36:44,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-28 11:36:44,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:36:44,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:36:44,973 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 11:36:44,973 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 11:36:44,973 INFO L794 eck$LassoCheckResult]: Stem: 376#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 369#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 370#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 377#L557-1 [2018-11-28 11:36:44,974 INFO L796 eck$LassoCheckResult]: Loop: 377#L557-1 assume test_fun_#t~short10; 378#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 371#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 372#L561 assume !(test_fun_#t~mem14 > test_fun_#t~mem15);havoc test_fun_#t~mem15;havoc test_fun_#t~mem14; 382#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 377#L557-1 [2018-11-28 11:36:44,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:44,974 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2018-11-28 11:36:44,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:44,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:44,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:44,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:36:44,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:44,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:44,994 INFO L82 PathProgramCache]: Analyzing trace with hash 38423577, now seen corresponding path program 1 times [2018-11-28 11:36:44,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:44,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:44,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:44,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:36:44,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:45,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:45,004 INFO L82 PathProgramCache]: Analyzing trace with hash 177751382, now seen corresponding path program 1 times [2018-11-28 11:36:45,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:45,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:45,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:45,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:36:45,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:36:45,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:36:45,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:36:45,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:36:45,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:36:45,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:36:45,155 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-28 11:36:45,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:36:45,175 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2018-11-28 11:36:45,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:36:45,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2018-11-28 11:36:45,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 11:36:45,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 20 transitions. [2018-11-28 11:36:45,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 11:36:45,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 11:36:45,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2018-11-28 11:36:45,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:36:45,178 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-28 11:36:45,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2018-11-28 11:36:45,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-28 11:36:45,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 11:36:45,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-11-28 11:36:45,179 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-28 11:36:45,179 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-28 11:36:45,179 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 11:36:45,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-11-28 11:36:45,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 11:36:45,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:36:45,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:36:45,180 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 11:36:45,180 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 11:36:45,180 INFO L794 eck$LassoCheckResult]: Stem: 424#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 418#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 419#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 425#L557-1 [2018-11-28 11:36:45,180 INFO L796 eck$LassoCheckResult]: Loop: 425#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 426#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 431#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 429#L561 assume !(test_fun_#t~mem14 > test_fun_#t~mem15);havoc test_fun_#t~mem15;havoc test_fun_#t~mem14; 430#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 425#L557-1 [2018-11-28 11:36:45,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:45,180 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 3 times [2018-11-28 11:36:45,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:45,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:45,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:45,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:36:45,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:45,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:45,198 INFO L82 PathProgramCache]: Analyzing trace with hash 40270619, now seen corresponding path program 1 times [2018-11-28 11:36:45,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:45,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:45,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:45,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:36:45,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:36:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:36:45,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:36:45,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:36:45,225 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:36:45,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:36:45,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:36:45,226 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-28 11:36:45,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:36:45,255 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-11-28 11:36:45,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:36:45,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2018-11-28 11:36:45,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 11:36:45,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 18 transitions. [2018-11-28 11:36:45,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 11:36:45,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 11:36:45,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2018-11-28 11:36:45,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:36:45,257 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-28 11:36:45,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2018-11-28 11:36:45,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-28 11:36:45,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 11:36:45,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-11-28 11:36:45,258 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-28 11:36:45,258 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-28 11:36:45,258 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 11:36:45,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2018-11-28 11:36:45,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 11:36:45,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:36:45,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:36:45,259 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 11:36:45,259 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 11:36:45,259 INFO L794 eck$LassoCheckResult]: Stem: 465#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 459#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 460#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 466#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 467#L557-3 [2018-11-28 11:36:45,259 INFO L796 eck$LassoCheckResult]: Loop: 467#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 471#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 470#L561 assume test_fun_#t~mem14 > test_fun_#t~mem15;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;call test_fun_#t~mem16 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem16 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem16; 462#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 472#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 467#L557-3 [2018-11-28 11:36:45,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:45,259 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-11-28 11:36:45,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:45,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:45,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:45,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:36:45,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:45,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:45,274 INFO L82 PathProgramCache]: Analyzing trace with hash 45962937, now seen corresponding path program 1 times [2018-11-28 11:36:45,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:45,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:45,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:45,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:36:45,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:45,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:45,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1272581938, now seen corresponding path program 1 times [2018-11-28 11:36:45,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:45,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:45,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:45,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:36:45,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:45,465 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2018-11-28 11:36:45,686 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2018-11-28 11:36:46,076 WARN L180 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 130 [2018-11-28 11:36:46,502 WARN L180 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2018-11-28 11:36:46,504 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:36:46,504 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:36:46,504 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:36:46,504 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:36:46,505 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:36:46,505 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:36:46,505 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:36:46,505 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:36:46,505 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.13-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-28 11:36:46,505 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:36:46,505 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:36:46,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:46,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:46,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:47,224 WARN L180 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 110 [2018-11-28 11:36:47,350 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2018-11-28 11:36:47,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:47,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:47,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:47,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:47,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:47,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:47,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:47,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:47,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:47,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:47,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:47,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:47,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:47,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:47,910 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-11-28 11:36:48,014 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-11-28 11:36:48,047 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:36:48,047 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:36:48,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:48,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:48,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:48,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:48,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:48,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:36:48,049 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:48,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:48,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:48,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:48,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:36:48,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:48,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:48,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:48,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:36:48,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:36:48,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:48,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:48,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:48,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:48,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:48,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:48,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:36:48,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:48,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:48,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:48,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:48,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:48,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:48,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:48,057 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:36:48,057 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:48,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:48,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:48,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:48,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:48,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:48,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:48,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:36:48,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:48,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:48,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:48,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:48,077 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:36:48,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:48,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:48,079 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:36:48,079 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:48,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:48,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:48,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:48,083 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:36:48,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:48,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:48,084 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:36:48,084 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:48,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:48,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:48,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:48,088 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:36:48,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:48,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:48,089 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:36:48,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:48,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:48,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:48,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:48,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:48,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:48,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:48,094 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:36:48,094 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:48,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:48,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:48,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:48,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:48,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:48,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:48,097 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:36:48,098 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:48,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:48,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:48,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:48,100 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:36:48,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:48,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:48,101 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:36:48,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:48,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:48,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:36:48,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:48,105 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:36:48,105 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:36:48,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:48,118 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-28 11:36:48,118 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 11:36:48,223 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:36:48,325 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 11:36:48,325 INFO L444 ModelExtractionUtils]: 81 out of 91 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-28 11:36:48,326 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:36:48,327 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-28 11:36:48,327 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:36:48,327 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 Supporting invariants [] [2018-11-28 11:36:48,572 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-11-28 11:36:48,573 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:36:48,573 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:36:48,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:36:48,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:36:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:36:48,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:36:48,681 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:36:48,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 58 [2018-11-28 11:36:48,725 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:36:48,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-11-28 11:36:48,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:36:48,766 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:36:48,767 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:36:48,769 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:36:48,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 49 [2018-11-28 11:36:48,771 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:36:48,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:36:48,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:36:48,803 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-11-28 11:36:48,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:36:48,826 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 11:36:48,827 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-28 11:36:48,850 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 30 states and 35 transitions. Complement of second has 7 states. [2018-11-28 11:36:48,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 11:36:48,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 11:36:48,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-28 11:36:48,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 5 letters. [2018-11-28 11:36:48,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:36:48,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 5 letters. [2018-11-28 11:36:48,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:36:48,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 10 letters. [2018-11-28 11:36:48,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:36:48,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2018-11-28 11:36:48,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 11:36:48,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 28 transitions. [2018-11-28 11:36:48,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 11:36:48,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 11:36:48,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2018-11-28 11:36:48,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:36:48,855 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-28 11:36:48,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2018-11-28 11:36:48,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-11-28 11:36:48,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 11:36:48,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-11-28 11:36:48,861 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-28 11:36:48,861 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-28 11:36:48,861 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 11:36:48,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2018-11-28 11:36:48,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 11:36:48,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:36:48,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:36:48,862 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:36:48,862 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:36:48,862 INFO L794 eck$LassoCheckResult]: Stem: 726#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 720#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 721#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 734#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 737#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 735#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 732#L561 assume test_fun_#t~mem14 > test_fun_#t~mem15;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;call test_fun_#t~mem16 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem16 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem16; 733#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 727#L557-1 assume test_fun_#t~short10; 728#L557-3 [2018-11-28 11:36:48,862 INFO L796 eck$LassoCheckResult]: Loop: 728#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 722#L558 assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; 723#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 741#L557-1 assume test_fun_#t~short10; 728#L557-3 [2018-11-28 11:36:48,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:48,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1272581936, now seen corresponding path program 1 times [2018-11-28 11:36:48,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:48,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:48,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:48,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:36:48,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:36:48,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:36:48,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:36:48,944 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0314856b-3418-4320-91c9-d6964a81efb1/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-11-28 11:36:48,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:36:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:36:48,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:36:48,992 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:36:48,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-11-28 11:36:49,016 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:36:49,017 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:36:49,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-11-28 11:36:49,042 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:36:49,055 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:36:49,063 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:36:49,071 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:36:49,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-11-28 11:36:49,073 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:36:49,089 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:36:49,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:36:49,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:36:49,110 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:13 [2018-11-28 11:36:49,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:36:49,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 46 [2018-11-28 11:36:49,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:36:49,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-28 11:36:49,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:36:49,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:36:49,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:36:49,193 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:16 [2018-11-28 11:36:49,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:36:49,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:36:49,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-28 11:36:49,235 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:36:49,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:49,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1480167, now seen corresponding path program 2 times [2018-11-28 11:36:49,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:49,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:49,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:49,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:36:49,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:49,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 11:36:49,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:36:49,344 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. cyclomatic complexity: 7 Second operand 11 states. [2018-11-28 11:36:49,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:36:49,384 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-28 11:36:49,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:36:49,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2018-11-28 11:36:49,385 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:36:49,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2018-11-28 11:36:49,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 11:36:49,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 11:36:49,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 11:36:49,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:36:49,385 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:36:49,385 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:36:49,385 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:36:49,385 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 11:36:49,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:36:49,385 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:36:49,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 11:36:49,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:36:49 BoogieIcfgContainer [2018-11-28 11:36:49,389 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 11:36:49,390 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:36:49,390 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:36:49,390 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:36:49,390 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:36:42" (3/4) ... [2018-11-28 11:36:49,393 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 11:36:49,393 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:36:49,393 INFO L168 Benchmark]: Toolchain (without parser) took 7963.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.5 MB). Free memory was 949.5 MB in the beginning and 1.0 GB in the end (delta: -90.3 MB). Peak memory consumption was 125.2 MB. Max. memory is 11.5 GB. [2018-11-28 11:36:49,394 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:36:49,394 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -164.3 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-11-28 11:36:49,394 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:36:49,394 INFO L168 Benchmark]: Boogie Preprocessor took 17.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:36:49,395 INFO L168 Benchmark]: RCFGBuilder took 219.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-28 11:36:49,395 INFO L168 Benchmark]: BuchiAutomizer took 7375.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 91.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.5 MB). Peak memory consumption was 141.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:36:49,396 INFO L168 Benchmark]: Witness Printer took 3.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:36:49,398 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 317.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -164.3 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 219.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7375.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 91.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.5 MB). Peak memory consumption was 141.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z_ref][z_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] + -1 * unknown-#memory_int-unknown[z_ref][z_ref] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.3s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 39 SDtfs, 64 SDslu, 37 SDs, 0 SdLazy, 138 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital630 mio100 ax103 hnf99 lsp73 ukn72 mio100 lsp30 div100 bol104 ite100 ukn100 eq182 hnf88 smp96 dnf231 smp73 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 222ms VariablesStem: 17 VariablesLoop: 12 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...