./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/a.10-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_475a91a5-3530-4a6b-a78e-70ce69ed7d48/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_475a91a5-3530-4a6b-a78e-70ce69ed7d48/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_475a91a5-3530-4a6b-a78e-70ce69ed7d48/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_475a91a5-3530-4a6b-a78e-70ce69ed7d48/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/a.10-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_475a91a5-3530-4a6b-a78e-70ce69ed7d48/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_475a91a5-3530-4a6b-a78e-70ce69ed7d48/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 fe0a03f8bb40d3c8ee514a7c216e0c7ba9f8c793 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 08:56:12,996 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 08:56:12,997 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 08:56:13,003 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 08:56:13,003 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 08:56:13,004 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 08:56:13,004 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 08:56:13,005 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 08:56:13,006 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 08:56:13,006 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 08:56:13,006 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 08:56:13,007 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 08:56:13,007 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 08:56:13,008 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 08:56:13,008 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 08:56:13,008 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 08:56:13,009 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 08:56:13,010 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 08:56:13,011 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 08:56:13,011 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 08:56:13,012 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 08:56:13,012 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 08:56:13,013 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 08:56:13,013 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 08:56:13,014 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 08:56:13,014 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 08:56:13,014 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 08:56:13,015 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 08:56:13,015 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 08:56:13,016 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 08:56:13,016 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 08:56:13,016 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 08:56:13,016 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 08:56:13,016 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 08:56:13,017 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 08:56:13,017 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 08:56:13,017 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_475a91a5-3530-4a6b-a78e-70ce69ed7d48/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 08:56:13,025 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 08:56:13,025 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 08:56:13,026 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 08:56:13,026 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 08:56:13,026 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 08:56:13,026 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 08:56:13,026 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 08:56:13,026 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 08:56:13,026 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 08:56:13,026 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 08:56:13,026 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 08:56:13,027 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 08:56:13,027 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 08:56:13,027 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 08:56:13,027 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 08:56:13,027 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 08:56:13,027 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 08:56:13,027 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 08:56:13,027 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 08:56:13,027 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 08:56:13,027 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 08:56:13,027 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 08:56:13,028 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 08:56:13,028 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 08:56:13,028 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 08:56:13,028 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 08:56:13,028 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 08:56:13,028 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 08:56:13,028 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 08:56:13,029 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_475a91a5-3530-4a6b-a78e-70ce69ed7d48/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 -> fe0a03f8bb40d3c8ee514a7c216e0c7ba9f8c793 [2018-12-02 08:56:13,045 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 08:56:13,051 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 08:56:13,053 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 08:56:13,054 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 08:56:13,055 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 08:56:13,055 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_475a91a5-3530-4a6b-a78e-70ce69ed7d48/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/a.10-alloca_true-termination_true-no-overflow.c.i [2018-12-02 08:56:13,089 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_475a91a5-3530-4a6b-a78e-70ce69ed7d48/bin-2019/uautomizer/data/31decade7/c872f46aef0944289625d4b39361d980/FLAGb38a96ff8 [2018-12-02 08:56:13,581 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 08:56:13,582 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_475a91a5-3530-4a6b-a78e-70ce69ed7d48/sv-benchmarks/c/termination-memory-alloca/a.10-alloca_true-termination_true-no-overflow.c.i [2018-12-02 08:56:13,588 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_475a91a5-3530-4a6b-a78e-70ce69ed7d48/bin-2019/uautomizer/data/31decade7/c872f46aef0944289625d4b39361d980/FLAGb38a96ff8 [2018-12-02 08:56:13,596 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_475a91a5-3530-4a6b-a78e-70ce69ed7d48/bin-2019/uautomizer/data/31decade7/c872f46aef0944289625d4b39361d980 [2018-12-02 08:56:13,598 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 08:56:13,599 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 08:56:13,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 08:56:13,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 08:56:13,602 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 08:56:13,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:56:13" (1/1) ... [2018-12-02 08:56:13,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21b6f768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:56:13, skipping insertion in model container [2018-12-02 08:56:13,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:56:13" (1/1) ... [2018-12-02 08:56:13,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 08:56:13,626 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 08:56:13,764 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:56:13,770 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 08:56:13,835 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:56:13,854 INFO L195 MainTranslator]: Completed translation [2018-12-02 08:56:13,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:56:13 WrapperNode [2018-12-02 08:56:13,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 08:56:13,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 08:56:13,855 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 08:56:13,855 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 08:56:13,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:56:13" (1/1) ... [2018-12-02 08:56:13,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:56:13" (1/1) ... [2018-12-02 08:56:13,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 08:56:13,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 08:56:13,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 08:56:13,879 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 08:56:13,884 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:56:13" (1/1) ... [2018-12-02 08:56:13,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:56:13" (1/1) ... [2018-12-02 08:56:13,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:56:13" (1/1) ... [2018-12-02 08:56:13,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:56:13" (1/1) ... [2018-12-02 08:56:13,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:56:13" (1/1) ... [2018-12-02 08:56:13,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:56:13" (1/1) ... [2018-12-02 08:56:13,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:56:13" (1/1) ... [2018-12-02 08:56:13,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 08:56:13,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 08:56:13,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 08:56:13,892 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 08:56:13,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:56:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_475a91a5-3530-4a6b-a78e-70ce69ed7d48/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 08:56:13,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 08:56:13,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 08:56:13,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 08:56:13,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 08:56:13,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 08:56:13,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 08:56:14,045 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 08:56:14,045 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-02 08:56:14,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:56:14 BoogieIcfgContainer [2018-12-02 08:56:14,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 08:56:14,046 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 08:56:14,046 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 08:56:14,048 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 08:56:14,049 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 08:56:14,049 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 08:56:13" (1/3) ... [2018-12-02 08:56:14,049 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2466284c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 08:56:14, skipping insertion in model container [2018-12-02 08:56:14,049 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 08:56:14,050 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:56:13" (2/3) ... [2018-12-02 08:56:14,050 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2466284c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 08:56:14, skipping insertion in model container [2018-12-02 08:56:14,050 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 08:56:14,050 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:56:14" (3/3) ... [2018-12-02 08:56:14,051 INFO L375 chiAutomizerObserver]: Analyzing ICFG a.10-alloca_true-termination_true-no-overflow.c.i [2018-12-02 08:56:14,082 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 08:56:14,082 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 08:56:14,082 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 08:56:14,082 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 08:56:14,082 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 08:56:14,082 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 08:56:14,082 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 08:56:14,082 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 08:56:14,083 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 08:56:14,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-12-02 08:56:14,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 08:56:14,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 08:56:14,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 08:56:14,107 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 08:56:14,107 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 08:56:14,107 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 08:56:14,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-12-02 08:56:14,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 08:56:14,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 08:56:14,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 08:56:14,108 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 08:56:14,108 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 08:56:14,113 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;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~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem11, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 11#L556-2true [2018-12-02 08:56:14,113 INFO L796 eck$LassoCheckResult]: Loop: 11#L556-2true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 12#L555-1true assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 7#L556true assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem10, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 11#L556-2true [2018-12-02 08:56:14,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:56:14,117 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-02 08:56:14,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:56:14,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:56:14,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:56:14,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:56:14,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:56:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:56:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:56:14,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:56:14,202 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 1 times [2018-12-02 08:56:14,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:56:14,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:56:14,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:56:14,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:56:14,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:56:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:56:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:56:14,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:56:14,216 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2018-12-02 08:56:14,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:56:14,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:56:14,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:56:14,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:56:14,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:56:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:56:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:56:14,486 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2018-12-02 08:56:14,560 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 08:56:14,560 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 08:56:14,560 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 08:56:14,560 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 08:56:14,561 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 08:56:14,561 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 08:56:14,561 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 08:56:14,561 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 08:56:14,561 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.10-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-12-02 08:56:14,561 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 08:56:14,561 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 08:56:14,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:14,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:14,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:14,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:14,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:14,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:14,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:14,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:14,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:14,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:14,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:14,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:14,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:14,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:14,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:14,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:14,758 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2018-12-02 08:56:15,082 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 08:56:15,085 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 08:56:15,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:15,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:15,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:56:15,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:15,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:15,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:15,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:56:15,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:56:15,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:15,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:15,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:15,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:56:15,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:15,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:15,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:15,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:56:15,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:56:15,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:15,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:15,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:15,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:56:15,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:15,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:15,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:15,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:56:15,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:56:15,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:15,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:15,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:15,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:15,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:15,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:15,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:56:15,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:56:15,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:15,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:15,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:15,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:15,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:15,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:15,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:56:15,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:56:15,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:15,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:15,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:15,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:15,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:15,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:15,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:56:15,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:56:15,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:15,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:15,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:15,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:56:15,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:15,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:15,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:15,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:56:15,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:56:15,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:15,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:15,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:15,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:56:15,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:15,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:15,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:15,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:56:15,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:56:15,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:15,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:15,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:15,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:56:15,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:15,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:15,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:15,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:56:15,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:56:15,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:15,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:15,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:15,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:15,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:15,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:15,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:56:15,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:56:15,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:15,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:15,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:15,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:56:15,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:15,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:15,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:15,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:56:15,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:56:15,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:15,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:15,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:15,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:56:15,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:15,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:15,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:15,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:56:15,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:56:15,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:15,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:15,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:15,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:56:15,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:15,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:15,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:15,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:56:15,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:56:15,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:15,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:15,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:15,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:15,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:15,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:15,120 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:56:15,120 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:56:15,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:15,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:15,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:15,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:56:15,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:15,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:15,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:15,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:56:15,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:56:15,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:15,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:15,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:15,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:15,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:15,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:15,127 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:56:15,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:56:15,143 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 08:56:15,151 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 08:56:15,152 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 08:56:15,153 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 08:56:15,154 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 08:56:15,154 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 08:56:15,155 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2018-12-02 08:56:15,188 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-12-02 08:56:15,193 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 08:56:15,194 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 08:56:15,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:56:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:56:15,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:56:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:56:15,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:56:15,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:56:15,269 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 08:56:15,270 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states. Second operand 4 states. [2018-12-02 08:56:15,305 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states.. Second operand 4 states. Result 31 states and 36 transitions. Complement of second has 10 states. [2018-12-02 08:56:15,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-02 08:56:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 08:56:15,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2018-12-02 08:56:15,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 2 letters. Loop has 3 letters. [2018-12-02 08:56:15,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 08:56:15,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 5 letters. Loop has 3 letters. [2018-12-02 08:56:15,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 08:56:15,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 2 letters. Loop has 6 letters. [2018-12-02 08:56:15,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 08:56:15,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2018-12-02 08:56:15,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 08:56:15,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 11 states and 14 transitions. [2018-12-02 08:56:15,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-02 08:56:15,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-02 08:56:15,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-12-02 08:56:15,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 08:56:15,313 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-02 08:56:15,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-12-02 08:56:15,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-02 08:56:15,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-02 08:56:15,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-12-02 08:56:15,330 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-02 08:56:15,330 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-02 08:56:15,330 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 08:56:15,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-12-02 08:56:15,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 08:56:15,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 08:56:15,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 08:56:15,331 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 08:56:15,331 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 08:56:15,331 INFO L794 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 168#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;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~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem11, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 169#L556-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 177#L555-1 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 171#L556 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem9, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem9; 172#L556-2 [2018-12-02 08:56:15,331 INFO L796 eck$LassoCheckResult]: Loop: 172#L556-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 175#L555-1 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 178#L556 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem10, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 172#L556-2 [2018-12-02 08:56:15,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:56:15,332 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2018-12-02 08:56:15,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:56:15,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:56:15,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:56:15,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:56:15,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:56:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:56:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:56:15,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:56:15,356 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 2 times [2018-12-02 08:56:15,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:56:15,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:56:15,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:56:15,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:56:15,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:56:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:56:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:56:15,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:56:15,366 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2018-12-02 08:56:15,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:56:15,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:56:15,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:56:15,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:56:15,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:56:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:56:15,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:56:15,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:56:15,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_475a91a5-3530-4a6b-a78e-70ce69ed7d48/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 08:56:15,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:56:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:56:15,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:56:15,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 08:56:15,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:56:15,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:56:15,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-12-02 08:56:15,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:56:15,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-12-02 08:56:15,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:56:15,554 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 34 treesize of output 25 [2018-12-02 08:56:15,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:56:15,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:56:15,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:56:15,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:16 [2018-12-02 08:56:15,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-12-02 08:56:15,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 15 [2018-12-02 08:56:15,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:56:15,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-02 08:56:15,595 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:56:15,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:56:15,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:56:15,599 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:42, output treesize:5 [2018-12-02 08:56:15,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:56:15,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 08:56:15,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-12-02 08:56:15,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 08:56:15,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-02 08:56:15,657 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 11 states. [2018-12-02 08:56:15,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:56:15,702 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-12-02 08:56:15,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:56:15,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2018-12-02 08:56:15,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 08:56:15,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2018-12-02 08:56:15,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-02 08:56:15,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-02 08:56:15,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2018-12-02 08:56:15,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 08:56:15,704 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-12-02 08:56:15,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2018-12-02 08:56:15,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-12-02 08:56:15,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-02 08:56:15,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-12-02 08:56:15,705 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-02 08:56:15,705 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-02 08:56:15,706 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 08:56:15,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2018-12-02 08:56:15,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 08:56:15,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 08:56:15,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 08:56:15,706 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 08:56:15,706 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 08:56:15,706 INFO L794 eck$LassoCheckResult]: Stem: 231#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 229#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;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~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem11, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 230#L556-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 236#L555-1 [2018-12-02 08:56:15,706 INFO L796 eck$LassoCheckResult]: Loop: 236#L555-1 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 232#L556 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem9, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem9; 233#L556-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 236#L555-1 [2018-12-02 08:56:15,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:56:15,706 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-12-02 08:56:15,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:56:15,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:56:15,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:56:15,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:56:15,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:56:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:56:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:56:15,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:56:15,716 INFO L82 PathProgramCache]: Analyzing trace with hash 41795, now seen corresponding path program 1 times [2018-12-02 08:56:15,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:56:15,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:56:15,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:56:15,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:56:15,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:56:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:56:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:56:15,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:56:15,722 INFO L82 PathProgramCache]: Analyzing trace with hash 889571264, now seen corresponding path program 2 times [2018-12-02 08:56:15,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:56:15,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:56:15,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:56:15,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:56:15,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:56:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:56:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:56:15,932 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 89 [2018-12-02 08:56:16,000 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 08:56:16,001 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 08:56:16,001 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 08:56:16,001 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 08:56:16,001 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 08:56:16,001 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 08:56:16,001 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 08:56:16,001 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 08:56:16,001 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.10-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-12-02 08:56:16,001 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 08:56:16,001 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 08:56:16,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:16,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:16,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:16,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:16,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:16,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:16,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:16,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:16,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:16,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:16,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:16,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:16,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:16,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 08:56:16,520 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 08:56:16,520 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 08:56:16,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:16,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:16,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:56:16,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:16,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:16,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:16,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:56:16,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:56:16,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:16,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:16,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:16,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:56:16,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:16,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:16,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:16,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:56:16,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:56:16,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:16,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:16,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:16,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:56:16,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:16,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:16,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:16,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:56:16,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:56:16,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:16,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:16,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:16,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:16,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:16,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:16,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:56:16,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:56:16,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:16,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:16,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:16,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:16,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:16,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:16,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:56:16,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:56:16,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:16,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:16,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:16,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:56:16,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:16,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:16,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:16,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:56:16,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:56:16,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:16,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:16,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:16,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:16,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:16,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:16,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:56:16,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:56:16,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:16,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:16,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:16,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 08:56:16,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:16,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:16,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:16,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 08:56:16,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 08:56:16,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:16,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:16,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:16,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:16,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:16,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:16,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:56:16,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:56:16,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:16,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:16,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:16,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:16,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:16,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:16,542 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:56:16,542 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:56:16,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:16,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:16,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:16,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:16,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:16,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:16,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:56:16,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:56:16,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:16,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:16,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:16,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:16,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:16,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:16,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:56:16,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:56:16,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:16,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:16,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:16,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:16,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:16,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:16,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:56:16,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:56:16,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:16,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:16,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:16,552 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 08:56:16,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:16,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:16,553 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 08:56:16,553 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:56:16,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:16,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:16,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:16,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:16,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:16,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:16,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:56:16,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:56:16,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:16,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:16,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:16,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:16,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:16,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:16,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 08:56:16,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:56:16,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:16,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:16,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:16,562 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 08:56:16,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:16,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:16,563 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 08:56:16,563 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:56:16,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:16,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:16,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:16,566 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 08:56:16,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 08:56:16,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:16,567 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 08:56:16,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 08:56:16,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 08:56:16,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 08:56:16,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 08:56:16,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 08:56:16,570 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 08:56:16,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 08:56:16,572 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-02 08:56:16,573 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 08:56:16,616 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 08:56:16,647 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 08:56:16,647 INFO L444 ModelExtractionUtils]: 52 out of 56 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 08:56:16,648 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 08:56:16,649 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-12-02 08:56:16,649 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 08:56:16,649 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2, 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_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2018-12-02 08:56:16,697 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-12-02 08:56:16,698 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 08:56:16,698 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 08:56:16,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:56:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:56:16,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:56:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:56:16,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:56:16,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:56:16,748 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-12-02 08:56:16,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:56:16,752 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-12-02 08:56:16,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:56:16,771 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:56:16,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:56:16,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:56:16,774 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-12-02 08:56:16,775 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:56:16,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:56:16,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:56:16,800 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-12-02 08:56:16,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:56:16,820 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 08:56:16,820 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-12-02 08:56:16,834 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 19 states and 21 transitions. Complement of second has 7 states. [2018-12-02 08:56:16,834 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-12-02 08:56:16,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 08:56:16,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2018-12-02 08:56:16,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 3 letters. [2018-12-02 08:56:16,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 08:56:16,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 6 letters. Loop has 3 letters. [2018-12-02 08:56:16,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 08:56:16,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 6 letters. [2018-12-02 08:56:16,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 08:56:16,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2018-12-02 08:56:16,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 08:56:16,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 11 states and 12 transitions. [2018-12-02 08:56:16,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-12-02 08:56:16,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-12-02 08:56:16,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2018-12-02 08:56:16,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 08:56:16,837 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-02 08:56:16,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2018-12-02 08:56:16,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-12-02 08:56:16,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-02 08:56:16,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-02 08:56:16,838 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-02 08:56:16,838 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-02 08:56:16,838 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 08:56:16,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2018-12-02 08:56:16,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 08:56:16,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 08:56:16,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 08:56:16,839 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2018-12-02 08:56:16,839 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 08:56:16,839 INFO L794 eck$LassoCheckResult]: Stem: 394#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 392#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;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~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem11, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 393#L556-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 400#L555-1 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 397#L556 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem10, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 398#L556-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 399#L555-1 [2018-12-02 08:56:16,839 INFO L796 eck$LassoCheckResult]: Loop: 399#L555-1 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 395#L556 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem9, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem9; 396#L556-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 399#L555-1 [2018-12-02 08:56:16,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:56:16,840 INFO L82 PathProgramCache]: Analyzing trace with hash 889571326, now seen corresponding path program 2 times [2018-12-02 08:56:16,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:56:16,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:56:16,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:56:16,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:56:16,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:56:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:56:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:56:16,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:56:16,855 INFO L82 PathProgramCache]: Analyzing trace with hash 41795, now seen corresponding path program 2 times [2018-12-02 08:56:16,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:56:16,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:56:16,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:56:16,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:56:16,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:56:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:56:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:56:16,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:56:16,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1271168550, now seen corresponding path program 2 times [2018-12-02 08:56:16,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:56:16,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:56:16,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:56:16,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:56:16,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:56:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:56:16,922 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:56:16,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:56:16,923 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_475a91a5-3530-4a6b-a78e-70ce69ed7d48/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 08:56:16,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 08:56:16,946 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 08:56:16,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 08:56:16,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:56:16,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:56:17,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:56:17,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:56:17,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 41 treesize of output 52 [2018-12-02 08:56:17,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:56:17,016 INFO L478 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 58 [2018-12-02 08:56:17,018 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-02 08:56:17,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:56:17,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:56:17,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:38 [2018-12-02 08:56:17,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-12-02 08:56:17,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-12-02 08:56:17,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:56:17,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-02 08:56:17,062 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:56:17,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:56:17,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:56:17,066 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:46, output treesize:3 [2018-12-02 08:56:17,080 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:56:17,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 08:56:17,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-12-02 08:56:17,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 08:56:17,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-12-02 08:56:17,132 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand 12 states. [2018-12-02 08:56:17,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:56:17,237 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-02 08:56:17,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:56:17,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 10 transitions. [2018-12-02 08:56:17,238 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 08:56:17,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 0 states and 0 transitions. [2018-12-02 08:56:17,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 08:56:17,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 08:56:17,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 08:56:17,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 08:56:17,239 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 08:56:17,239 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 08:56:17,239 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 08:56:17,239 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 08:56:17,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 08:56:17,239 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 08:56:17,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 08:56:17,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 08:56:17 BoogieIcfgContainer [2018-12-02 08:56:17,243 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 08:56:17,243 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 08:56:17,243 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 08:56:17,243 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 08:56:17,244 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:56:14" (3/4) ... [2018-12-02 08:56:17,246 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 08:56:17,246 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 08:56:17,246 INFO L168 Benchmark]: Toolchain (without parser) took 3647.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 951.7 MB in the beginning and 853.9 MB in the end (delta: 97.8 MB). Peak memory consumption was 260.8 MB. Max. memory is 11.5 GB. [2018-12-02 08:56:17,247 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:56:17,247 INFO L168 Benchmark]: CACSL2BoogieTranslator took 254.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -150.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-02 08:56:17,247 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 08:56:17,248 INFO L168 Benchmark]: Boogie Preprocessor took 13.21 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:56:17,248 INFO L168 Benchmark]: RCFGBuilder took 153.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-12-02 08:56:17,248 INFO L168 Benchmark]: BuchiAutomizer took 3196.92 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.1 GB in the beginning and 853.9 MB in the end (delta: 228.5 MB). Peak memory consumption was 278.9 MB. Max. memory is 11.5 GB. [2018-12-02 08:56:17,248 INFO L168 Benchmark]: Witness Printer took 2.71 ms. Allocated memory is still 1.2 GB. Free memory is still 853.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:56:17,250 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.14 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 254.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -150.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.21 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 153.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3196.92 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.1 GB in the beginning and 853.9 MB in the end (delta: 228.5 MB). Peak memory consumption was 278.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.71 ms. Allocated memory is still 1.2 GB. Free memory is still 853.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x_ref][x_ref] + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.1s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 2.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 12 SDtfs, 13 SDslu, 17 SDs, 0 SdLazy, 104 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital265 mio100 ax106 hnf100 lsp91 ukn64 mio100 lsp32 div100 bol100 ite100 ukn100 eq196 hnf87 smp100 dnf115 smp100 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 79ms VariablesStem: 10 VariablesLoop: 8 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...