./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.11-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6a6eef63-4761-4423-a1cc-4cd3944cca17/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6a6eef63-4761-4423-a1cc-4cd3944cca17/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6a6eef63-4761-4423-a1cc-4cd3944cca17/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6a6eef63-4761-4423-a1cc-4cd3944cca17/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.11-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6a6eef63-4761-4423-a1cc-4cd3944cca17/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6a6eef63-4761-4423-a1cc-4cd3944cca17/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 6d6fa40570ac98fcded670ccb8a913ea07efa9b1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:01:18,987 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:01:18,988 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:01:18,994 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:01:18,994 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:01:18,995 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:01:18,996 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:01:18,997 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:01:18,998 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:01:18,999 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:01:19,000 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:01:19,000 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:01:19,001 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:01:19,002 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:01:19,002 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:01:19,003 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:01:19,004 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:01:19,005 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:01:19,006 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:01:19,008 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:01:19,008 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:01:19,010 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:01:19,011 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:01:19,011 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:01:19,012 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:01:19,012 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:01:19,013 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:01:19,014 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:01:19,014 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:01:19,015 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:01:19,015 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:01:19,016 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:01:19,016 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:01:19,016 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:01:19,017 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:01:19,017 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:01:19,017 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6a6eef63-4761-4423-a1cc-4cd3944cca17/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 12:01:19,029 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:01:19,029 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:01:19,030 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:01:19,030 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:01:19,030 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:01:19,031 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:01:19,031 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:01:19,031 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:01:19,031 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:01:19,031 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:01:19,031 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:01:19,031 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:01:19,032 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:01:19,032 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:01:19,032 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:01:19,032 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:01:19,032 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:01:19,032 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:01:19,032 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:01:19,033 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:01:19,033 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:01:19,033 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:01:19,033 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:01:19,033 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:01:19,033 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:01:19,033 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:01:19,034 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:01:19,034 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:01:19,034 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_6a6eef63-4761-4423-a1cc-4cd3944cca17/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 -> 6d6fa40570ac98fcded670ccb8a913ea07efa9b1 [2018-11-10 12:01:19,058 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:01:19,068 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:01:19,070 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:01:19,072 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:01:19,072 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:01:19,072 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6a6eef63-4761-4423-a1cc-4cd3944cca17/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.11-alloca_true-termination_true-no-overflow.c.i [2018-11-10 12:01:19,117 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6a6eef63-4761-4423-a1cc-4cd3944cca17/bin-2019/uautomizer/data/d0d7f734f/63822126f00c4c81b733c0d1e027f7d5/FLAG12c53671f [2018-11-10 12:01:19,465 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:01:19,465 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6a6eef63-4761-4423-a1cc-4cd3944cca17/sv-benchmarks/c/termination-memory-alloca/b.11-alloca_true-termination_true-no-overflow.c.i [2018-11-10 12:01:19,476 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6a6eef63-4761-4423-a1cc-4cd3944cca17/bin-2019/uautomizer/data/d0d7f734f/63822126f00c4c81b733c0d1e027f7d5/FLAG12c53671f [2018-11-10 12:01:19,488 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6a6eef63-4761-4423-a1cc-4cd3944cca17/bin-2019/uautomizer/data/d0d7f734f/63822126f00c4c81b733c0d1e027f7d5 [2018-11-10 12:01:19,490 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:01:19,491 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:01:19,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:01:19,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:01:19,495 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:01:19,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:01:19" (1/1) ... [2018-11-10 12:01:19,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2af148b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:19, skipping insertion in model container [2018-11-10 12:01:19,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:01:19" (1/1) ... [2018-11-10 12:01:19,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:01:19,537 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:01:19,738 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:01:19,746 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:01:19,773 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:01:19,801 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:01:19,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:19 WrapperNode [2018-11-10 12:01:19,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:01:19,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:01:19,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:01:19,802 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:01:19,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:19" (1/1) ... [2018-11-10 12:01:19,856 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:19" (1/1) ... [2018-11-10 12:01:19,871 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:01:19,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:01:19,871 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:01:19,871 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:01:19,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:19" (1/1) ... [2018-11-10 12:01:19,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:19" (1/1) ... [2018-11-10 12:01:19,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:19" (1/1) ... [2018-11-10 12:01:19,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:19" (1/1) ... [2018-11-10 12:01:19,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:19" (1/1) ... [2018-11-10 12:01:19,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:19" (1/1) ... [2018-11-10 12:01:19,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:19" (1/1) ... [2018-11-10 12:01:19,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:01:19,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:01:19,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:01:19,888 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:01:19,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a6eef63-4761-4423-a1cc-4cd3944cca17/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:01:19,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 12:01:19,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 12:01:19,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:01:19,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:01:20,157 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:01:20,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:01:20 BoogieIcfgContainer [2018-11-10 12:01:20,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:01:20,157 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:01:20,157 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:01:20,160 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:01:20,160 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:01:20,160 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:01:19" (1/3) ... [2018-11-10 12:01:20,161 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7416d9b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:01:20, skipping insertion in model container [2018-11-10 12:01:20,161 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:01:20,161 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:19" (2/3) ... [2018-11-10 12:01:20,162 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7416d9b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:01:20, skipping insertion in model container [2018-11-10 12:01:20,162 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:01:20,162 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:01:20" (3/3) ... [2018-11-10 12:01:20,163 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.11-alloca_true-termination_true-no-overflow.c.i [2018-11-10 12:01:20,206 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:01:20,206 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:01:20,206 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:01:20,206 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:01:20,206 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:01:20,206 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:01:20,206 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:01:20,207 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:01:20,207 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:01:20,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states. [2018-11-10 12:01:20,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2018-11-10 12:01:20,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:01:20,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:01:20,236 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 12:01:20,236 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:01:20,236 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:01:20,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states. [2018-11-10 12:01:20,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2018-11-10 12:01:20,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:01:20,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:01:20,239 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 12:01:20,239 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:01:20,243 INFO L793 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 18#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 20#L552true SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 22#L552-1true SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 38#L553true SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 12#L559-4true [2018-11-10 12:01:20,244 INFO L795 eck$LassoCheckResult]: Loop: 12#L559-4true assume true; 13#L555true SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 17#L555-1true test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 39#L555-2true assume !test_fun_#t~short8; 28#L555-7true test_fun_#t~short13 := test_fun_#t~short8; 31#L555-8true assume test_fun_#t~short13; 3#L555-18true test_fun_#t~short16 := test_fun_#t~short13; 5#L555-19true assume !test_fun_#t~short16; 41#L555-24true assume !!test_fun_#t~short16;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short12; 32#L556true SUMMARY for call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 34#L556-1true SUMMARY for call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 36#L556-2true assume test_fun_#t~mem17 > test_fun_#t~mem18;havoc test_fun_#t~mem18;havoc test_fun_#t~mem17; 6#L557true SUMMARY for call test_fun_#t~mem19 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 9#L557-1true SUMMARY for call write~int(test_fun_#t~mem19 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 14#L557-2true havoc test_fun_#t~mem19; 12#L559-4true [2018-11-10 12:01:20,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:20,248 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 1 times [2018-11-10 12:01:20,249 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:20,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:20,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:20,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:01:20,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:20,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:20,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1895968668, now seen corresponding path program 1 times [2018-11-10 12:01:20,344 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:20,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:20,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:20,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:01:20,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:20,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:01:20,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:01:20,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:01:20,389 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:01:20,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:01:20,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:01:20,400 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 4 states. [2018-11-10 12:01:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:01:20,454 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-11-10 12:01:20,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:01:20,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 72 transitions. [2018-11-10 12:01:20,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2018-11-10 12:01:20,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 57 states and 65 transitions. [2018-11-10 12:01:20,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2018-11-10 12:01:20,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2018-11-10 12:01:20,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 65 transitions. [2018-11-10 12:01:20,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:01:20,465 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-11-10 12:01:20,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 65 transitions. [2018-11-10 12:01:20,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-11-10 12:01:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-10 12:01:20,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-11-10 12:01:20,488 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-11-10 12:01:20,488 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-11-10 12:01:20,488 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:01:20,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 50 transitions. [2018-11-10 12:01:20,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2018-11-10 12:01:20,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:01:20,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:01:20,489 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 12:01:20,489 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:01:20,490 INFO L793 eck$LassoCheckResult]: Stem: 161#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 140#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 141#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 144#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 146#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 136#L559-4 [2018-11-10 12:01:20,490 INFO L795 eck$LassoCheckResult]: Loop: 136#L559-4 assume true; 137#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 138#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 139#L555-2 assume test_fun_#t~short8; 160#L555-3 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 162#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 164#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 149#L555-7 test_fun_#t~short13 := test_fun_#t~short8; 150#L555-8 assume test_fun_#t~short13; 123#L555-18 test_fun_#t~short16 := test_fun_#t~short13; 124#L555-19 assume !test_fun_#t~short16; 127#L555-24 assume !!test_fun_#t~short16;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short12; 154#L556 SUMMARY for call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 155#L556-1 SUMMARY for call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 157#L556-2 assume test_fun_#t~mem17 > test_fun_#t~mem18;havoc test_fun_#t~mem18;havoc test_fun_#t~mem17; 129#L557 SUMMARY for call test_fun_#t~mem19 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 130#L557-1 SUMMARY for call write~int(test_fun_#t~mem19 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 134#L557-2 havoc test_fun_#t~mem19; 136#L559-4 [2018-11-10 12:01:20,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:20,490 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 2 times [2018-11-10 12:01:20,490 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:20,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:20,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:20,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:01:20,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:20,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:20,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1946191036, now seen corresponding path program 1 times [2018-11-10 12:01:20,517 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:20,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:20,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:20,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:01:20,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:20,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:01:20,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:01:20,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:01:20,544 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:01:20,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:01:20,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:01:20,544 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-10 12:01:20,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:01:20,556 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-10 12:01:20,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:01:20,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 50 transitions. [2018-11-10 12:01:20,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2018-11-10 12:01:20,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 44 states and 49 transitions. [2018-11-10 12:01:20,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-11-10 12:01:20,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-11-10 12:01:20,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 49 transitions. [2018-11-10 12:01:20,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:01:20,560 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-10 12:01:20,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 49 transitions. [2018-11-10 12:01:20,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-10 12:01:20,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-10 12:01:20,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-10 12:01:20,564 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-10 12:01:20,564 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-10 12:01:20,564 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 12:01:20,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 49 transitions. [2018-11-10 12:01:20,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2018-11-10 12:01:20,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:01:20,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:01:20,565 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 12:01:20,566 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:01:20,567 INFO L793 eck$LassoCheckResult]: Stem: 254#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 235#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 236#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 239#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 241#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 230#L559-4 [2018-11-10 12:01:20,567 INFO L795 eck$LassoCheckResult]: Loop: 230#L559-4 assume true; 231#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 232#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 234#L555-2 assume test_fun_#t~short8; 253#L555-3 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 255#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 257#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 259#L555-7 test_fun_#t~short13 := test_fun_#t~short8; 261#L555-8 assume test_fun_#t~short13; 218#L555-18 test_fun_#t~short16 := test_fun_#t~short13; 219#L555-19 assume test_fun_#t~short16; 222#L555-20 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-20 227#L555-21 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-21 229#L555-22 test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 233#L555-24 assume !!test_fun_#t~short16;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short12; 248#L556 SUMMARY for call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 249#L556-1 SUMMARY for call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 251#L556-2 assume test_fun_#t~mem17 > test_fun_#t~mem18;havoc test_fun_#t~mem18;havoc test_fun_#t~mem17; 223#L557 SUMMARY for call test_fun_#t~mem19 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 224#L557-1 SUMMARY for call write~int(test_fun_#t~mem19 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 228#L557-2 havoc test_fun_#t~mem19; 230#L559-4 [2018-11-10 12:01:20,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:20,567 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 3 times [2018-11-10 12:01:20,567 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:20,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:20,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:20,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:01:20,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:20,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:20,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1502430525, now seen corresponding path program 1 times [2018-11-10 12:01:20,598 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:20,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:20,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:20,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:01:20,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:20,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:20,626 INFO L82 PathProgramCache]: Analyzing trace with hash -769594339, now seen corresponding path program 1 times [2018-11-10 12:01:20,627 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:20,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:20,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:20,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:01:20,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:20,816 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2018-11-10 12:01:21,071 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2018-11-10 12:01:21,172 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:01:21,172 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:01:21,173 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:01:21,173 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:01:21,173 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:01:21,173 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:01:21,173 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:01:21,173 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:01:21,173 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.11-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-10 12:01:21,174 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:01:21,174 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:01:21,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:21,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:21,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:21,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:21,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:21,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:21,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:21,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:21,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:21,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:21,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:21,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:21,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:21,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:21,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:21,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:21,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:21,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:21,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:21,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:21,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:21,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:21,508 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 97 [2018-11-10 12:01:21,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-11-10 12:01:21,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:21,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:21,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-11-10 12:01:21,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-11-10 12:01:21,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:21,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-11-10 12:01:22,041 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:01:22,045 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:01:22,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:22,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:22,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:22,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:22,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:22,052 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:22,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:22,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:22,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:22,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:22,055 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:22,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:22,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:22,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:22,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:22,057 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:22,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:22,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,062 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:22,062 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:22,065 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:22,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:22,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:22,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:22,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:22,067 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:22,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:22,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:22,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:22,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:22,073 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:22,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:22,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:22,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:22,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:22,076 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:22,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:22,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:22,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:22,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:22,078 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:22,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:22,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:22,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:22,086 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,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-11-10 12:01:22,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:22,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:22,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:22,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:22,088 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:22,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:22,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:22,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:22,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:22,090 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,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-11-10 12:01:22,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:22,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:22,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:22,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:22,092 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,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-11-10 12:01:22,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:22,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:22,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:22,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:22,094 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,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-11-10 12:01:22,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:22,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:22,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:22,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:22,095 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:22,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:22,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:22,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:22,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:22,097 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,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-11-10 12:01:22,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:22,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:22,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:22,101 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,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-11-10 12:01:22,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:22,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:22,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:22,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:22,104 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:22,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:22,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:22,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:22,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:22,106 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,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-11-10 12:01:22,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:22,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:22,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:22,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:22,108 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,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-11-10 12:01:22,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:22,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:22,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:22,113 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:22,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:22,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:22,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:22,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:22,115 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:22,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:22,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,117 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:22,117 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:22,119 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,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-11-10 12:01:22,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:22,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:22,122 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:22,131 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:22,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:22,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:22,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:22,136 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:22,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:22,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,141 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:22,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:22,165 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:22,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,166 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:01:22,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,167 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:01:22,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:22,172 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:22,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,173 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:01:22,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,175 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:01:22,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:22,180 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:22,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:22,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:22,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:22,187 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:22,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,188 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:01:22,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,189 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:01:22,189 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:22,194 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:22,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:22,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:22,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:22,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:22,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:22,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:22,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:22,210 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:01:22,223 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 12:01:22,223 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 12:01:22,225 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:01:22,226 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:01:22,226 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:01:22,227 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-11-10 12:01:22,282 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-10 12:01:22,285 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:01:22,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:22,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:01:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:22,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:01:22,479 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:01:22,494 INFO L477 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 54 treesize of output 64 [2018-11-10 12:01:22,501 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:01:22,502 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:01:22,506 INFO L477 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 50 treesize of output 55 [2018-11-10 12:01:22,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:22,545 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:01:22,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2018-11-10 12:01:22,547 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:22,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:01:22,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-10 12:01:22,594 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:65 [2018-11-10 12:01:22,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:01:22,627 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 10 loop predicates [2018-11-10 12:01:22,627 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 49 transitions. cyclomatic complexity: 6 Second operand 12 states. [2018-11-10 12:01:22,905 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 49 transitions. cyclomatic complexity: 6. Second operand 12 states. Result 119 states and 133 transitions. Complement of second has 21 states. [2018-11-10 12:01:22,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2018-11-10 12:01:22,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 12:01:22,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 44 transitions. [2018-11-10 12:01:22,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 44 transitions. Stem has 5 letters. Loop has 21 letters. [2018-11-10 12:01:22,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:01:22,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 44 transitions. Stem has 26 letters. Loop has 21 letters. [2018-11-10 12:01:22,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:01:22,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 44 transitions. Stem has 5 letters. Loop has 42 letters. [2018-11-10 12:01:22,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:01:22,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 133 transitions. [2018-11-10 12:01:22,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2018-11-10 12:01:22,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 110 states and 124 transitions. [2018-11-10 12:01:22,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2018-11-10 12:01:22,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2018-11-10 12:01:22,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 124 transitions. [2018-11-10 12:01:22,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:01:22,916 INFO L705 BuchiCegarLoop]: Abstraction has 110 states and 124 transitions. [2018-11-10 12:01:22,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 124 transitions. [2018-11-10 12:01:22,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2018-11-10 12:01:22,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-10 12:01:22,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2018-11-10 12:01:22,921 INFO L728 BuchiCegarLoop]: Abstraction has 102 states and 115 transitions. [2018-11-10 12:01:22,921 INFO L608 BuchiCegarLoop]: Abstraction has 102 states and 115 transitions. [2018-11-10 12:01:22,921 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 12:01:22,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 115 transitions. [2018-11-10 12:01:22,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2018-11-10 12:01:22,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:01:22,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:01:22,922 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:01:22,922 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:01:22,922 INFO L793 eck$LassoCheckResult]: Stem: 664#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 629#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 630#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 635#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 638#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 662#L559-4 assume true; 619#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 695#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 693#L555-2 assume test_fun_#t~short8; 691#L555-3 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 690#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 688#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 684#L555-7 test_fun_#t~short13 := test_fun_#t~short8; 682#L555-8 assume test_fun_#t~short13; 680#L555-18 test_fun_#t~short16 := test_fun_#t~short13; 679#L555-19 assume test_fun_#t~short16; 678#L555-20 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-20 677#L555-21 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-21 624#L555-22 test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 625#L555-24 assume !!test_fun_#t~short16;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short12; 676#L556 SUMMARY for call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 655#L556-1 SUMMARY for call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 656#L556-2 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17; 641#L559 [2018-11-10 12:01:22,923 INFO L795 eck$LassoCheckResult]: Loop: 641#L559 SUMMARY for call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 600#L559-1 SUMMARY for call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 601#L559-2 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21; 608#L560 SUMMARY for call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 673#L560-1 SUMMARY for call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560-1 646#L560-2 havoc test_fun_#t~mem22; 616#L559-4 assume true; 621#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 622#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 627#L555-2 assume test_fun_#t~short8; 660#L555-3 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 665#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 668#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 671#L555-7 test_fun_#t~short13 := test_fun_#t~short8; 697#L555-8 assume test_fun_#t~short13; 596#L555-18 test_fun_#t~short16 := test_fun_#t~short13; 597#L555-19 assume test_fun_#t~short16; 602#L555-20 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-20 610#L555-21 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-21 614#L555-22 test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 663#L555-24 assume !!test_fun_#t~short16;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short12; 649#L556 SUMMARY for call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 650#L556-1 SUMMARY for call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 675#L556-2 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17; 641#L559 [2018-11-10 12:01:22,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:22,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1711559942, now seen corresponding path program 1 times [2018-11-10 12:01:22,923 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:22,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:22,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:22,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:01:22,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:22,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:22,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1912949335, now seen corresponding path program 1 times [2018-11-10 12:01:22,945 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:22,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:22,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:22,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:01:22,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:22,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:22,958 INFO L82 PathProgramCache]: Analyzing trace with hash -964588626, now seen corresponding path program 1 times [2018-11-10 12:01:22,958 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:22,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:22,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:22,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:01:22,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:23,137 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2018-11-10 12:01:23,568 WARN L179 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 129 [2018-11-10 12:01:23,682 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-11-10 12:01:23,684 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:01:23,684 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:01:23,684 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:01:23,684 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:01:23,684 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:01:23,684 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:01:23,684 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:01:23,684 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:01:23,684 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.11-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2018-11-10 12:01:23,684 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:01:23,685 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:01:23,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:23,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:23,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:23,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:23,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:23,952 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 102 [2018-11-10 12:01:24,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:24,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:24,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:24,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:24,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:24,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:24,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:24,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:24,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:24,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:24,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:24,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:24,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:24,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:24,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:24,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:24,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:24,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:24,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:24,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:24,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:24,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:24,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:24,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:24,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:24,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:24,460 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:01:24,460 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:01:24,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:24,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:24,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:24,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:24,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:24,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:24,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:24,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:24,466 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:24,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:24,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:24,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:24,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:24,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:24,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:24,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:24,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:24,468 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:24,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:24,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:24,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:24,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:24,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:24,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:24,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:24,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:24,469 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:24,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:24,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:24,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:24,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:24,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:24,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:24,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:24,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:24,470 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:24,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:24,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:24,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:24,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:24,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:24,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:24,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:24,473 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:24,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:24,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:24,474 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:01:24,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:24,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:24,475 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:01:24,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:24,480 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:24,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:24,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:24,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:24,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:24,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:24,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:24,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:24,483 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:24,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:24,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:24,483 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:01:24,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:24,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:24,484 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:01:24,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:24,488 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:24,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:24,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:24,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:24,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:24,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:24,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:24,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:24,491 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:24,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:24,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:24,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:24,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:24,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:24,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:24,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:24,495 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:24,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:24,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:24,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:24,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:24,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:24,497 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:24,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:24,517 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:01:24,540 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 12:01:24,540 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 12:01:24,540 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:01:24,543 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:01:24,543 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:01:24,543 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2018-11-10 12:01:24,611 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-10 12:01:24,612 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:01:24,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:24,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:01:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:24,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:01:24,664 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:01:24,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 12:01:24,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 12:01:24,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:24,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:24,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:24,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2018-11-10 12:01:24,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:01:24,742 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 12:01:24,742 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 102 states and 115 transitions. cyclomatic complexity: 15 Second operand 8 states. [2018-11-10 12:01:24,938 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 102 states and 115 transitions. cyclomatic complexity: 15. Second operand 8 states. Result 227 states and 253 transitions. Complement of second has 15 states. [2018-11-10 12:01:24,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 12:01:24,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 12:01:24,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2018-11-10 12:01:24,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 104 transitions. Stem has 23 letters. Loop has 24 letters. [2018-11-10 12:01:24,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:01:24,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 104 transitions. Stem has 47 letters. Loop has 24 letters. [2018-11-10 12:01:24,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:01:24,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 104 transitions. Stem has 23 letters. Loop has 48 letters. [2018-11-10 12:01:24,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:01:24,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 227 states and 253 transitions. [2018-11-10 12:01:24,945 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 67 [2018-11-10 12:01:24,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 227 states to 219 states and 245 transitions. [2018-11-10 12:01:24,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 133 [2018-11-10 12:01:24,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2018-11-10 12:01:24,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 219 states and 245 transitions. [2018-11-10 12:01:24,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:01:24,947 INFO L705 BuchiCegarLoop]: Abstraction has 219 states and 245 transitions. [2018-11-10 12:01:24,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states and 245 transitions. [2018-11-10 12:01:24,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 168. [2018-11-10 12:01:24,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-10 12:01:24,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 190 transitions. [2018-11-10 12:01:24,955 INFO L728 BuchiCegarLoop]: Abstraction has 168 states and 190 transitions. [2018-11-10 12:01:24,955 INFO L608 BuchiCegarLoop]: Abstraction has 168 states and 190 transitions. [2018-11-10 12:01:24,955 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 12:01:24,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 190 transitions. [2018-11-10 12:01:24,956 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 67 [2018-11-10 12:01:24,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:01:24,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:01:24,957 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:01:24,957 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:01:24,960 INFO L793 eck$LassoCheckResult]: Stem: 1274#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1237#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 1238#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 1243#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 1246#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 1273#L559-4 assume true; 1314#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 1313#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1308#L555-2 assume test_fun_#t~short8; 1309#L555-3 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 1333#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 1332#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 1330#L555-7 test_fun_#t~short13 := test_fun_#t~short8; 1327#L555-8 assume test_fun_#t~short13; 1325#L555-18 test_fun_#t~short16 := test_fun_#t~short13; 1324#L555-19 assume test_fun_#t~short16; 1323#L555-20 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-20 1322#L555-21 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-21 1321#L555-22 test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 1320#L555-24 assume !!test_fun_#t~short16;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short12; 1319#L556 SUMMARY for call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 1318#L556-1 SUMMARY for call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 1317#L556-2 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17; 1316#L559 SUMMARY for call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 1204#L559-1 [2018-11-10 12:01:24,960 INFO L795 eck$LassoCheckResult]: Loop: 1204#L559-1 SUMMARY for call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 1205#L559-2 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21; 1214#L560 SUMMARY for call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 1286#L560-1 SUMMARY for call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560-1 1255#L560-2 havoc test_fun_#t~mem22; 1223#L559-4 assume true; 1224#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 1227#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1235#L555-2 assume !test_fun_#t~short8; 1270#L555-7 test_fun_#t~short13 := test_fun_#t~short8; 1366#L555-8 assume !test_fun_#t~short13; 1365#L555-10 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-10 1364#L555-11 test_fun_#t~short12 := test_fun_#t~mem9 < 0; 1269#L555-12 assume !test_fun_#t~short12; 1247#L555-17 test_fun_#t~short13 := test_fun_#t~short12; 1200#L555-18 test_fun_#t~short16 := test_fun_#t~short13; 1201#L555-19 assume test_fun_#t~short16; 1208#L555-20 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-20 1217#L555-21 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-21 1221#L555-22 test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 1233#L555-24 assume !!test_fun_#t~short16;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short12; 1259#L556 SUMMARY for call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 1260#L556-1 SUMMARY for call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 1265#L556-2 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17; 1249#L559 SUMMARY for call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 1204#L559-1 [2018-11-10 12:01:24,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:24,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1518750716, now seen corresponding path program 1 times [2018-11-10 12:01:24,961 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:24,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:24,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:24,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:01:24,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:24,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:24,981 INFO L82 PathProgramCache]: Analyzing trace with hash 387926788, now seen corresponding path program 1 times [2018-11-10 12:01:24,981 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:24,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:24,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:24,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:01:24,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:25,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:01:25,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:01:25,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 12:01:25,045 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:01:25,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:01:25,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:01:25,045 INFO L87 Difference]: Start difference. First operand 168 states and 190 transitions. cyclomatic complexity: 26 Second operand 7 states. [2018-11-10 12:01:25,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:01:25,158 INFO L93 Difference]: Finished difference Result 270 states and 297 transitions. [2018-11-10 12:01:25,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:01:25,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 297 transitions. [2018-11-10 12:01:25,160 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 92 [2018-11-10 12:01:25,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 270 states and 297 transitions. [2018-11-10 12:01:25,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 168 [2018-11-10 12:01:25,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 168 [2018-11-10 12:01:25,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 297 transitions. [2018-11-10 12:01:25,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:01:25,163 INFO L705 BuchiCegarLoop]: Abstraction has 270 states and 297 transitions. [2018-11-10 12:01:25,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 297 transitions. [2018-11-10 12:01:25,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 183. [2018-11-10 12:01:25,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-10 12:01:25,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 205 transitions. [2018-11-10 12:01:25,172 INFO L728 BuchiCegarLoop]: Abstraction has 183 states and 205 transitions. [2018-11-10 12:01:25,172 INFO L608 BuchiCegarLoop]: Abstraction has 183 states and 205 transitions. [2018-11-10 12:01:25,172 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 12:01:25,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 205 transitions. [2018-11-10 12:01:25,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 70 [2018-11-10 12:01:25,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:01:25,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:01:25,174 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:01:25,174 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:01:25,174 INFO L793 eck$LassoCheckResult]: Stem: 1739#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1695#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 1696#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 1701#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 1704#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 1732#L559-4 assume true; 1764#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 1765#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1758#L555-2 assume test_fun_#t~short8; 1760#L555-3 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 1745#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 1746#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 1828#L555-7 test_fun_#t~short13 := test_fun_#t~short8; 1826#L555-8 assume test_fun_#t~short13; 1821#L555-18 test_fun_#t~short16 := test_fun_#t~short13; 1819#L555-19 assume test_fun_#t~short16; 1814#L555-20 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-20 1813#L555-21 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-21 1812#L555-22 test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 1737#L555-24 assume !!test_fun_#t~short16;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short12; 1721#L556 SUMMARY for call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 1722#L556-1 SUMMARY for call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 1761#L556-2 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17; 1757#L559 SUMMARY for call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 1662#L559-1 [2018-11-10 12:01:25,175 INFO L795 eck$LassoCheckResult]: Loop: 1662#L559-1 SUMMARY for call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 1663#L559-2 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21; 1672#L560 SUMMARY for call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 1753#L560-1 SUMMARY for call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560-1 1714#L560-2 havoc test_fun_#t~mem22; 1684#L559-4 assume true; 1685#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 1687#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1692#L555-2 assume !test_fun_#t~short8; 1733#L555-7 test_fun_#t~short13 := test_fun_#t~short8; 1825#L555-8 assume !test_fun_#t~short13; 1824#L555-10 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-10 1823#L555-11 test_fun_#t~short12 := test_fun_#t~mem9 < 0; 1822#L555-12 assume test_fun_#t~short12; 1817#L555-13 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-13 1820#L555-14 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-14 1815#L555-15 test_fun_#t~short12 := test_fun_#t~mem11 > -2147483648 - test_fun_#t~mem10; 1807#L555-17 test_fun_#t~short13 := test_fun_#t~short12; 1806#L555-18 test_fun_#t~short16 := test_fun_#t~short13; 1805#L555-19 assume test_fun_#t~short16; 1804#L555-20 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-20 1803#L555-21 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-21 1802#L555-22 test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 1801#L555-24 assume !!test_fun_#t~short16;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short12; 1800#L556 SUMMARY for call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 1727#L556-1 SUMMARY for call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 1728#L556-2 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17; 1708#L559 SUMMARY for call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 1662#L559-1 [2018-11-10 12:01:25,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:25,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1518750716, now seen corresponding path program 2 times [2018-11-10 12:01:25,175 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:25,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:25,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:25,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:01:25,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:25,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:25,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1169749921, now seen corresponding path program 1 times [2018-11-10 12:01:25,194 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:25,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:25,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:25,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:01:25,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:25,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:25,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1726751270, now seen corresponding path program 1 times [2018-11-10 12:01:25,210 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:25,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:25,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:25,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:01:25,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:25,401 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:01:25,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:01:25,401 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a6eef63-4761-4423-a1cc-4cd3944cca17/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:01:25,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:01:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:25,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:01:25,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 21 [2018-11-10 12:01:25,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 21 treesize of output 16 [2018-11-10 12:01:25,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:25,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:25,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:25,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:7 [2018-11-10 12:01:25,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 12:01:25,648 INFO L477 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-11-10 12:01:25,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:25,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:25,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:25,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 12:01:25,660 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:01:25,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:01:25,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 22 [2018-11-10 12:01:25,841 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 74 [2018-11-10 12:01:25,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-10 12:01:25,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-11-10 12:01:25,863 INFO L87 Difference]: Start difference. First operand 183 states and 205 transitions. cyclomatic complexity: 26 Second operand 22 states. [2018-11-10 12:01:26,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:01:26,438 INFO L93 Difference]: Finished difference Result 239 states and 264 transitions. [2018-11-10 12:01:26,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-10 12:01:26,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 239 states and 264 transitions. [2018-11-10 12:01:26,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 84 [2018-11-10 12:01:26,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 239 states to 232 states and 256 transitions. [2018-11-10 12:01:26,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2018-11-10 12:01:26,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 156 [2018-11-10 12:01:26,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 232 states and 256 transitions. [2018-11-10 12:01:26,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:01:26,442 INFO L705 BuchiCegarLoop]: Abstraction has 232 states and 256 transitions. [2018-11-10 12:01:26,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states and 256 transitions. [2018-11-10 12:01:26,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 170. [2018-11-10 12:01:26,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-10 12:01:26,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 190 transitions. [2018-11-10 12:01:26,451 INFO L728 BuchiCegarLoop]: Abstraction has 170 states and 190 transitions. [2018-11-10 12:01:26,451 INFO L608 BuchiCegarLoop]: Abstraction has 170 states and 190 transitions. [2018-11-10 12:01:26,451 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 12:01:26,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 170 states and 190 transitions. [2018-11-10 12:01:26,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 46 [2018-11-10 12:01:26,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:01:26,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:01:26,453 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:01:26,453 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:01:26,453 INFO L793 eck$LassoCheckResult]: Stem: 2390#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2345#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 2346#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 2351#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 2354#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 2388#L559-4 assume true; 2434#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 2453#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 2450#L555-2 assume test_fun_#t~short8; 2448#L555-3 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 2446#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 2444#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 2442#L555-7 test_fun_#t~short13 := test_fun_#t~short8; 2439#L555-8 assume test_fun_#t~short13; 2435#L555-18 test_fun_#t~short16 := test_fun_#t~short13; 2433#L555-19 assume test_fun_#t~short16; 2432#L555-20 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-20 2431#L555-21 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-21 2430#L555-22 test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 2429#L555-24 assume !!test_fun_#t~short16;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short12; 2428#L556 SUMMARY for call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 2427#L556-1 SUMMARY for call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 2426#L556-2 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17; 2425#L559 SUMMARY for call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 2312#L559-1 SUMMARY for call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 2313#L559-2 assume !(test_fun_#t~mem20 == test_fun_#t~mem21);havoc test_fun_#t~mem20;havoc test_fun_#t~mem21; 2322#L562 [2018-11-10 12:01:26,454 INFO L795 eck$LassoCheckResult]: Loop: 2322#L562 SUMMARY for call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L562 2394#L562-1 SUMMARY for call write~int(test_fun_#t~mem23 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L562-1 2397#L562-2 havoc test_fun_#t~mem23; 2330#L559-4 assume true; 2333#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 2342#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 2343#L555-2 assume test_fun_#t~short8; 2385#L555-3 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 2391#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 2395#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 2359#L555-7 test_fun_#t~short13 := test_fun_#t~short8; 2360#L555-8 assume test_fun_#t~short13; 2308#L555-18 test_fun_#t~short16 := test_fun_#t~short13; 2309#L555-19 assume test_fun_#t~short16; 2316#L555-20 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-20 2324#L555-21 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-21 2328#L555-22 test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 2340#L555-24 assume !!test_fun_#t~short16;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short12; 2369#L556 SUMMARY for call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 2370#L556-1 SUMMARY for call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 2376#L556-2 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17; 2382#L559 SUMMARY for call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 2436#L559-1 SUMMARY for call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 2403#L559-2 assume !(test_fun_#t~mem20 == test_fun_#t~mem21);havoc test_fun_#t~mem20;havoc test_fun_#t~mem21; 2322#L562 [2018-11-10 12:01:26,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:26,454 INFO L82 PathProgramCache]: Analyzing trace with hash -769440412, now seen corresponding path program 1 times [2018-11-10 12:01:26,454 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:26,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:26,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:26,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:01:26,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:26,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:26,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1968869401, now seen corresponding path program 1 times [2018-11-10 12:01:26,478 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:26,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:26,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:26,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:01:26,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:26,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:26,489 INFO L82 PathProgramCache]: Analyzing trace with hash -236151684, now seen corresponding path program 1 times [2018-11-10 12:01:26,489 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:26,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:26,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:26,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:01:26,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:26,663 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2018-11-10 12:01:27,063 WARN L179 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 136 [2018-11-10 12:01:27,186 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-11-10 12:01:27,188 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:01:27,188 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:01:27,188 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:01:27,188 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:01:27,188 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:01:27,188 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:01:27,188 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:01:27,188 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:01:27,188 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.11-alloca_true-termination_true-no-overflow.c.i_Iteration7_Lasso [2018-11-10 12:01:27,189 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:01:27,189 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:01:27,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:27,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:27,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:27,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:27,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:27,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:27,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:27,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:27,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:27,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:27,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:27,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:27,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:27,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:27,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:27,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:27,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:27,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:27,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:27,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:27,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:27,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:27,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:27,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:27,510 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2018-11-10 12:01:27,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-11-10 12:01:27,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-11-10 12:01:27,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-11-10 12:01:27,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:27,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-11-10 12:01:27,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-11-10 12:01:27,995 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:01:27,995 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:01:27,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:27,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:27,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:27,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:27,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:27,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:27,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:27,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:27,998 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:27,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:27,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:27,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:27,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:27,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:27,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:27,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:27,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:28,000 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:28,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:28,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:28,002 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:28,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:28,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:28,003 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:28,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:28,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:28,005 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:28,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:28,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:28,007 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:28,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:28,009 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:28,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:28,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:28,011 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:28,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:28,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:28,013 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:28,014 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:28,015 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:28,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:28,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:28,017 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:28,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:28,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:28,019 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:28,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:28,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:28,021 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:28,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:28,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:28,022 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:28,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:28,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:28,024 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,025 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:28,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:28,026 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:28,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:28,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:28,028 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:28,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:28,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:28,030 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,031 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:28,031 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:28,033 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:28,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:28,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:28,035 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:28,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:28,038 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:28,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:28,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:28,039 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:28,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:28,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:28,041 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:28,043 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:28,044 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,045 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:28,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:28,047 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:28,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:28,061 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,063 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:28,063 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:28,066 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,067 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:01:28,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,068 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:01:28,068 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:28,071 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:28,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:28,077 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,078 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:28,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:28,080 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,080 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:01:28,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,081 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:01:28,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:28,084 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,086 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:28,086 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:28,087 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,094 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:01:28,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,098 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:01:28,098 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:28,101 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,102 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:28,103 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:28,106 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:28,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:28,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:28,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:28,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:28,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:28,109 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:28,109 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:28,119 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:01:28,126 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 12:01:28,126 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 12:01:28,127 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:01:28,127 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:01:28,128 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:01:28,128 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3 Supporting invariants [] [2018-11-10 12:01:28,274 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-10 12:01:28,275 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:01:28,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:28,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:01:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:28,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:01:28,318 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:01:28,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 12:01:28,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 12:01:28,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:28,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:28,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:28,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2018-11-10 12:01:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:01:28,439 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 10 loop predicates [2018-11-10 12:01:28,439 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 170 states and 190 transitions. cyclomatic complexity: 23 Second operand 11 states. [2018-11-10 12:01:28,652 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 170 states and 190 transitions. cyclomatic complexity: 23. Second operand 11 states. Result 294 states and 328 transitions. Complement of second has 21 states. [2018-11-10 12:01:28,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2018-11-10 12:01:28,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-10 12:01:28,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 83 transitions. [2018-11-10 12:01:28,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 83 transitions. Stem has 26 letters. Loop has 24 letters. [2018-11-10 12:01:28,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:01:28,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 83 transitions. Stem has 50 letters. Loop has 24 letters. [2018-11-10 12:01:28,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:01:28,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 83 transitions. Stem has 26 letters. Loop has 48 letters. [2018-11-10 12:01:28,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:01:28,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 294 states and 328 transitions. [2018-11-10 12:01:28,656 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 89 [2018-11-10 12:01:28,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 294 states to 290 states and 324 transitions. [2018-11-10 12:01:28,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2018-11-10 12:01:28,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 190 [2018-11-10 12:01:28,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 290 states and 324 transitions. [2018-11-10 12:01:28,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:01:28,658 INFO L705 BuchiCegarLoop]: Abstraction has 290 states and 324 transitions. [2018-11-10 12:01:28,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states and 324 transitions. [2018-11-10 12:01:28,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 285. [2018-11-10 12:01:28,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-11-10 12:01:28,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 319 transitions. [2018-11-10 12:01:28,664 INFO L728 BuchiCegarLoop]: Abstraction has 285 states and 319 transitions. [2018-11-10 12:01:28,664 INFO L608 BuchiCegarLoop]: Abstraction has 285 states and 319 transitions. [2018-11-10 12:01:28,664 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 12:01:28,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 285 states and 319 transitions. [2018-11-10 12:01:28,665 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 89 [2018-11-10 12:01:28,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:01:28,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:01:28,667 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:01:28,667 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:01:28,667 INFO L793 eck$LassoCheckResult]: Stem: 3146#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3106#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 3107#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 3112#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 3115#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 3143#L559-4 assume true; 3230#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 3229#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 3227#L555-2 assume test_fun_#t~short8; 3225#L555-3 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 3223#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 3221#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 3218#L555-7 test_fun_#t~short13 := test_fun_#t~short8; 3215#L555-8 assume test_fun_#t~short13; 3212#L555-18 test_fun_#t~short16 := test_fun_#t~short13; 3210#L555-19 assume test_fun_#t~short16; 3203#L555-20 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-20 3199#L555-21 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-21 3196#L555-22 test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 3191#L555-24 assume !!test_fun_#t~short16;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short12; 3185#L556 SUMMARY for call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 3180#L556-1 SUMMARY for call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 3177#L556-2 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17; 3174#L559 SUMMARY for call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 3076#L559-1 SUMMARY for call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 3077#L559-2 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21; 3086#L560 SUMMARY for call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 3159#L560-1 SUMMARY for call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560-1 3127#L560-2 havoc test_fun_#t~mem22; 3128#L559-4 assume true; 3226#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 3224#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 3222#L555-2 assume test_fun_#t~short8; 3219#L555-3 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 3220#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 3285#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 3283#L555-7 test_fun_#t~short13 := test_fun_#t~short8; 3280#L555-8 assume test_fun_#t~short13; 3277#L555-18 test_fun_#t~short16 := test_fun_#t~short13; 3275#L555-19 assume test_fun_#t~short16; 3273#L555-20 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-20 3269#L555-21 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-21 3267#L555-22 test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 3265#L555-24 assume !!test_fun_#t~short16;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short12; 3263#L556 SUMMARY for call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 3261#L556-1 SUMMARY for call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 3259#L556-2 assume test_fun_#t~mem17 > test_fun_#t~mem18;havoc test_fun_#t~mem18;havoc test_fun_#t~mem17; 3080#L557 [2018-11-10 12:01:28,667 INFO L795 eck$LassoCheckResult]: Loop: 3080#L557 SUMMARY for call test_fun_#t~mem19 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 3081#L557-1 SUMMARY for call write~int(test_fun_#t~mem19 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 3089#L557-2 havoc test_fun_#t~mem19; 3099#L559-4 assume true; 3336#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 3335#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 3334#L555-2 assume test_fun_#t~short8; 3288#L555-3 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 3289#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 3319#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 3318#L555-7 test_fun_#t~short13 := test_fun_#t~short8; 3316#L555-8 assume test_fun_#t~short13; 3314#L555-18 test_fun_#t~short16 := test_fun_#t~short13; 3313#L555-19 assume test_fun_#t~short16; 3312#L555-20 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-20 3311#L555-21 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-21 3310#L555-22 test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 3309#L555-24 assume !!test_fun_#t~short16;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short12; 3308#L556 SUMMARY for call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 3307#L556-1 SUMMARY for call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 3306#L556-2 assume test_fun_#t~mem17 > test_fun_#t~mem18;havoc test_fun_#t~mem18;havoc test_fun_#t~mem17; 3080#L557 [2018-11-10 12:01:28,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:28,667 INFO L82 PathProgramCache]: Analyzing trace with hash -964588631, now seen corresponding path program 1 times [2018-11-10 12:01:28,668 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:28,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:28,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:28,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:01:28,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:28,802 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:01:28,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:01:28,802 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a6eef63-4761-4423-a1cc-4cd3944cca17/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-11-10 12:01:28,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:01:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:28,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:01:28,836 INFO L477 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-11-10 12:01:28,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:28,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:28,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-11-10 12:01:28,904 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:01:28,906 INFO L477 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 32 treesize of output 37 [2018-11-10 12:01:28,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-11-10 12:01:28,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:28,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:28,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:28,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2018-11-10 12:01:28,937 INFO L477 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 28 treesize of output 24 [2018-11-10 12:01:28,940 INFO L477 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 15 treesize of output 11 [2018-11-10 12:01:28,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:28,946 INFO L477 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-11-10 12:01:28,946 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:28,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:28,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:28,951 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2018-11-10 12:01:28,964 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:01:28,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:01:28,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2018-11-10 12:01:28,982 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:01:28,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:28,982 INFO L82 PathProgramCache]: Analyzing trace with hash -781622787, now seen corresponding path program 2 times [2018-11-10 12:01:28,982 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:28,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:28,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:28,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:01:28,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:29,100 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2018-11-10 12:01:29,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 12:01:29,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-11-10 12:01:29,121 INFO L87 Difference]: Start difference. First operand 285 states and 319 transitions. cyclomatic complexity: 39 Second operand 17 states. [2018-11-10 12:01:29,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:01:29,405 INFO L93 Difference]: Finished difference Result 279 states and 311 transitions. [2018-11-10 12:01:29,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 12:01:29,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 279 states and 311 transitions. [2018-11-10 12:01:29,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2018-11-10 12:01:29,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 279 states to 279 states and 311 transitions. [2018-11-10 12:01:29,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2018-11-10 12:01:29,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2018-11-10 12:01:29,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 279 states and 311 transitions. [2018-11-10 12:01:29,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:01:29,407 INFO L705 BuchiCegarLoop]: Abstraction has 279 states and 311 transitions. [2018-11-10 12:01:29,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states and 311 transitions. [2018-11-10 12:01:29,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2018-11-10 12:01:29,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-10 12:01:29,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 293 transitions. [2018-11-10 12:01:29,412 INFO L728 BuchiCegarLoop]: Abstraction has 263 states and 293 transitions. [2018-11-10 12:01:29,412 INFO L608 BuchiCegarLoop]: Abstraction has 263 states and 293 transitions. [2018-11-10 12:01:29,412 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 12:01:29,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 263 states and 293 transitions. [2018-11-10 12:01:29,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2018-11-10 12:01:29,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:01:29,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:01:29,414 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:01:29,415 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:01:29,415 INFO L793 eck$LassoCheckResult]: Stem: 3889#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3845#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 3846#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 3851#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 3854#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 3886#L559-4 assume true; 3961#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 4003#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 4000#L555-2 assume test_fun_#t~short8; 3998#L555-3 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 3996#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 3995#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 3992#L555-7 test_fun_#t~short13 := test_fun_#t~short8; 3987#L555-8 assume test_fun_#t~short13; 3985#L555-18 test_fun_#t~short16 := test_fun_#t~short13; 3984#L555-19 assume test_fun_#t~short16; 3983#L555-20 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-20 3982#L555-21 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-21 3978#L555-22 test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 3977#L555-24 assume !!test_fun_#t~short16;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short12; 3976#L556 SUMMARY for call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 3975#L556-1 SUMMARY for call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 3974#L556-2 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17; 3972#L559 SUMMARY for call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 3973#L559-1 SUMMARY for call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 3816#L559-2 assume !(test_fun_#t~mem20 == test_fun_#t~mem21);havoc test_fun_#t~mem20;havoc test_fun_#t~mem21; 3817#L562 SUMMARY for call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L562 3979#L562-1 SUMMARY for call write~int(test_fun_#t~mem23 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L562-1 4066#L562-2 havoc test_fun_#t~mem23; 4065#L559-4 assume true; 3835#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 3836#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 3843#L555-2 assume test_fun_#t~short8; 3884#L555-3 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 3890#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 3902#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 3903#L555-7 test_fun_#t~short13 := test_fun_#t~short8; 4053#L555-8 assume test_fun_#t~short13; 4051#L555-18 test_fun_#t~short16 := test_fun_#t~short13; 4050#L555-19 assume test_fun_#t~short16; 3823#L555-20 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-20 3824#L555-21 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-21 3840#L555-22 test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 3841#L555-24 assume !!test_fun_#t~short16;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short12; 3869#L556 SUMMARY for call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 3870#L556-1 SUMMARY for call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 3908#L556-2 assume test_fun_#t~mem17 > test_fun_#t~mem18;havoc test_fun_#t~mem18;havoc test_fun_#t~mem17; 3819#L557 [2018-11-10 12:01:29,415 INFO L795 eck$LassoCheckResult]: Loop: 3819#L557 SUMMARY for call test_fun_#t~mem19 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 3820#L557-1 SUMMARY for call write~int(test_fun_#t~mem19 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 3826#L557-2 havoc test_fun_#t~mem19; 3831#L559-4 assume true; 3832#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 4063#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 4061#L555-2 assume test_fun_#t~short8; 4060#L555-3 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 3897#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 3898#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 4042#L555-7 test_fun_#t~short13 := test_fun_#t~short8; 4041#L555-8 assume test_fun_#t~short13; 3806#L555-18 test_fun_#t~short16 := test_fun_#t~short13; 3807#L555-19 assume test_fun_#t~short16; 3814#L555-20 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-20 3828#L555-21 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-21 3829#L555-22 test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 3887#L555-24 assume !!test_fun_#t~short16;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short12; 3888#L556 SUMMARY for call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 3980#L556-1 SUMMARY for call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 3981#L556-2 assume test_fun_#t~mem17 > test_fun_#t~mem18;havoc test_fun_#t~mem18;havoc test_fun_#t~mem17; 3819#L557 [2018-11-10 12:01:29,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:29,415 INFO L82 PathProgramCache]: Analyzing trace with hash 815273193, now seen corresponding path program 1 times [2018-11-10 12:01:29,415 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:29,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:29,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:29,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:01:29,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:29,788 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:01:29,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:01:29,788 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a6eef63-4761-4423-a1cc-4cd3944cca17/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:01:29,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:01:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:29,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:01:29,826 INFO L477 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-11-10 12:01:29,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:29,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:29,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-11-10 12:01:29,932 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2018-11-10 12:01:29,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 27 treesize of output 22 [2018-11-10 12:01:29,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:29,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:29,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:29,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:16 [2018-11-10 12:01:29,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-11-10 12:01:29,988 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 12:01:29,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:29,994 INFO L477 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-11-10 12:01:29,994 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:29,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:30,008 INFO L477 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 32 treesize of output 24 [2018-11-10 12:01:30,012 INFO L477 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 15 treesize of output 11 [2018-11-10 12:01:30,012 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:30,030 INFO L477 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-11-10 12:01:30,030 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:30,033 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:30,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:01:30,038 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:63, output treesize:9 [2018-11-10 12:01:30,049 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:01:30,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:01:30,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 20 [2018-11-10 12:01:30,065 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:01:30,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:30,065 INFO L82 PathProgramCache]: Analyzing trace with hash -781622787, now seen corresponding path program 3 times [2018-11-10 12:01:30,065 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:30,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:30,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:30,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:01:30,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:30,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-10 12:01:30,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-11-10 12:01:30,181 INFO L87 Difference]: Start difference. First operand 263 states and 293 transitions. cyclomatic complexity: 34 Second operand 21 states. [2018-11-10 12:01:30,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:01:30,587 INFO L93 Difference]: Finished difference Result 310 states and 338 transitions. [2018-11-10 12:01:30,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 12:01:30,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 310 states and 338 transitions. [2018-11-10 12:01:30,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2018-11-10 12:01:30,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 310 states to 267 states and 291 transitions. [2018-11-10 12:01:30,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2018-11-10 12:01:30,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2018-11-10 12:01:30,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 267 states and 291 transitions. [2018-11-10 12:01:30,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:01:30,590 INFO L705 BuchiCegarLoop]: Abstraction has 267 states and 291 transitions. [2018-11-10 12:01:30,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states and 291 transitions. [2018-11-10 12:01:30,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 206. [2018-11-10 12:01:30,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-11-10 12:01:30,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 228 transitions. [2018-11-10 12:01:30,594 INFO L728 BuchiCegarLoop]: Abstraction has 206 states and 228 transitions. [2018-11-10 12:01:30,594 INFO L608 BuchiCegarLoop]: Abstraction has 206 states and 228 transitions. [2018-11-10 12:01:30,594 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 12:01:30,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 206 states and 228 transitions. [2018-11-10 12:01:30,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2018-11-10 12:01:30,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:01:30,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:01:30,596 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:01:30,596 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:01:30,596 INFO L793 eck$LassoCheckResult]: Stem: 4635#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4589#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 4590#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 4595#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 4598#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 4630#L559-4 assume true; 4675#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 4741#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 4739#L555-2 assume test_fun_#t~short8; 4738#L555-3 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 4737#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 4736#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 4735#L555-7 test_fun_#t~short13 := test_fun_#t~short8; 4733#L555-8 assume test_fun_#t~short13; 4730#L555-18 test_fun_#t~short16 := test_fun_#t~short13; 4724#L555-19 assume test_fun_#t~short16; 4708#L555-20 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-20 4706#L555-21 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-21 4704#L555-22 test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 4680#L555-24 assume !!test_fun_#t~short16;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short12; 4615#L556 SUMMARY for call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 4616#L556-1 SUMMARY for call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 4670#L556-2 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17; 4669#L559 SUMMARY for call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 4557#L559-1 SUMMARY for call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 4558#L559-2 assume !(test_fun_#t~mem20 == test_fun_#t~mem21);havoc test_fun_#t~mem20;havoc test_fun_#t~mem21; 4566#L562 SUMMARY for call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L562 4640#L562-1 SUMMARY for call write~int(test_fun_#t~mem23 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L562-1 4647#L562-2 havoc test_fun_#t~mem23; 4575#L559-4 assume true; 4576#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 4587#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 4588#L555-2 assume test_fun_#t~short8; 4634#L555-3 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 4643#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 4644#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 4723#L555-7 test_fun_#t~short13 := test_fun_#t~short8; 4721#L555-8 assume test_fun_#t~short13; 4707#L555-18 test_fun_#t~short16 := test_fun_#t~short13; 4705#L555-19 assume test_fun_#t~short16; 4703#L555-20 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-20 4678#L555-21 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-21 4674#L555-22 test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 4665#L555-24 assume !!test_fun_#t~short16;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short12; 4664#L556 SUMMARY for call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 4663#L556-1 SUMMARY for call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 4661#L556-2 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17; 4658#L559 SUMMARY for call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 4659#L559-1 SUMMARY for call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 4666#L559-2 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21; 4650#L560 [2018-11-10 12:01:30,596 INFO L795 eck$LassoCheckResult]: Loop: 4650#L560 SUMMARY for call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 4651#L560-1 SUMMARY for call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560-1 4607#L560-2 havoc test_fun_#t~mem22; 4608#L559-4 assume true; 4577#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 4578#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 4631#L555-2 assume test_fun_#t~short8; 4632#L555-3 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 4637#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 4642#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 4603#L555-7 test_fun_#t~short13 := test_fun_#t~short8; 4604#L555-8 assume test_fun_#t~short13; 4553#L555-18 test_fun_#t~short16 := test_fun_#t~short13; 4554#L555-19 assume test_fun_#t~short16; 4561#L555-20 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-20 4568#L555-21 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-21 4571#L555-22 test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 4583#L555-24 assume !!test_fun_#t~short16;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short12; 4636#L556 SUMMARY for call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 4622#L556-1 SUMMARY for call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 4623#L556-2 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17; 4662#L559 SUMMARY for call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 4660#L559-1 SUMMARY for call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 4657#L559-2 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21; 4650#L560 [2018-11-10 12:01:30,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:30,596 INFO L82 PathProgramCache]: Analyzing trace with hash -236151689, now seen corresponding path program 1 times [2018-11-10 12:01:30,596 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:30,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:30,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:30,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:01:30,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:30,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:30,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1975394905, now seen corresponding path program 2 times [2018-11-10 12:01:30,622 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:30,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:30,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:30,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:01:30,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:30,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:30,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1059439409, now seen corresponding path program 1 times [2018-11-10 12:01:30,636 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:30,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:30,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:30,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:01:30,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:30,775 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 40 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 12:01:30,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:01:30,775 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a6eef63-4761-4423-a1cc-4cd3944cca17/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:01:30,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:01:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:30,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:01:30,822 INFO L477 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-11-10 12:01:30,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:30,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:30,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-11-10 12:01:30,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 12:01:30,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 12:01:30,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:30,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:30,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:30,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:4 [2018-11-10 12:01:30,862 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:01:30,864 INFO L477 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 32 treesize of output 37 [2018-11-10 12:01:30,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-11-10 12:01:30,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:30,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:30,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:30,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2018-11-10 12:01:30,891 INFO L477 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 28 treesize of output 24 [2018-11-10 12:01:30,893 INFO L477 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 15 treesize of output 11 [2018-11-10 12:01:30,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:30,898 INFO L477 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-11-10 12:01:30,898 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:30,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:30,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:30,902 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2018-11-10 12:01:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 40 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 12:01:30,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:01:30,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2018-11-10 12:01:31,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 12:01:31,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-11-10 12:01:31,041 INFO L87 Difference]: Start difference. First operand 206 states and 228 transitions. cyclomatic complexity: 26 Second operand 16 states. [2018-11-10 12:01:31,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:01:31,257 INFO L93 Difference]: Finished difference Result 238 states and 261 transitions. [2018-11-10 12:01:31,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 12:01:31,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 238 states and 261 transitions. [2018-11-10 12:01:31,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-10 12:01:31,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 238 states to 215 states and 236 transitions. [2018-11-10 12:01:31,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 135 [2018-11-10 12:01:31,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 [2018-11-10 12:01:31,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 215 states and 236 transitions. [2018-11-10 12:01:31,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:01:31,260 INFO L705 BuchiCegarLoop]: Abstraction has 215 states and 236 transitions. [2018-11-10 12:01:31,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states and 236 transitions. [2018-11-10 12:01:31,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 209. [2018-11-10 12:01:31,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-11-10 12:01:31,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 230 transitions. [2018-11-10 12:01:31,263 INFO L728 BuchiCegarLoop]: Abstraction has 209 states and 230 transitions. [2018-11-10 12:01:31,263 INFO L608 BuchiCegarLoop]: Abstraction has 209 states and 230 transitions. [2018-11-10 12:01:31,263 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 12:01:31,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 209 states and 230 transitions. [2018-11-10 12:01:31,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2018-11-10 12:01:31,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:01:31,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:01:31,265 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:01:31,265 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:01:31,266 INFO L793 eck$LassoCheckResult]: Stem: 5329#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5278#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 5279#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 5284#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 5288#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 5326#L559-4 assume true; 5268#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 5271#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 5276#L555-2 assume test_fun_#t~short8; 5330#L555-3 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 5331#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 5335#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 5339#L555-7 test_fun_#t~short13 := test_fun_#t~short8; 5446#L555-8 assume test_fun_#t~short13; 5445#L555-18 test_fun_#t~short16 := test_fun_#t~short13; 5253#L555-19 assume test_fun_#t~short16; 5254#L555-20 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-20 5262#L555-21 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-21 5265#L555-22 test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 5274#L555-24 assume !!test_fun_#t~short16;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short12; 5305#L556 SUMMARY for call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 5306#L556-1 SUMMARY for call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 5312#L556-2 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17; 5436#L559 SUMMARY for call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 5249#L559-1 SUMMARY for call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 5250#L559-2 assume !(test_fun_#t~mem20 == test_fun_#t~mem21);havoc test_fun_#t~mem20;havoc test_fun_#t~mem21; 5374#L562 SUMMARY for call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L562 5334#L562-1 SUMMARY for call write~int(test_fun_#t~mem23 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L562-1 5338#L562-2 havoc test_fun_#t~mem23; 5269#L559-4 assume true; 5270#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 5272#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 5277#L555-2 assume test_fun_#t~short8; 5365#L555-3 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 5363#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 5361#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 5358#L555-7 test_fun_#t~short13 := test_fun_#t~short8; 5354#L555-8 assume test_fun_#t~short13; 5352#L555-18 test_fun_#t~short16 := test_fun_#t~short13; 5255#L555-19 assume test_fun_#t~short16; 5256#L555-20 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-20 5263#L555-21 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-21 5266#L555-22 test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 5275#L555-24 assume !!test_fun_#t~short16;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short12; 5307#L556 SUMMARY for call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 5308#L556-1 SUMMARY for call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 5313#L556-2 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17; 5294#L559 SUMMARY for call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 5295#L559-1 SUMMARY for call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 5371#L559-2 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21; 5372#L560 [2018-11-10 12:01:31,266 INFO L795 eck$LassoCheckResult]: Loop: 5372#L560 SUMMARY for call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 5343#L560-1 SUMMARY for call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560-1 5344#L560-2 havoc test_fun_#t~mem22; 5433#L559-4 assume true; 5431#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 5429#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 5427#L555-2 assume test_fun_#t~short8; 5424#L555-3 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 5422#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 5417#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 5407#L555-7 test_fun_#t~short13 := test_fun_#t~short8; 5399#L555-8 assume test_fun_#t~short13; 5396#L555-18 test_fun_#t~short16 := test_fun_#t~short13; 5394#L555-19 assume test_fun_#t~short16; 5392#L555-20 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-20 5390#L555-21 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-21 5388#L555-22 test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 5386#L555-24 assume !!test_fun_#t~short16;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short12; 5384#L556 SUMMARY for call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 5382#L556-1 SUMMARY for call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 5380#L556-2 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17; 5378#L559 SUMMARY for call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 5376#L559-1 SUMMARY for call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 5257#L559-2 assume !(test_fun_#t~mem20 == test_fun_#t~mem21);havoc test_fun_#t~mem20;havoc test_fun_#t~mem21; 5258#L562 SUMMARY for call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L562 5333#L562-1 SUMMARY for call write~int(test_fun_#t~mem23 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L562-1 5337#L562-2 havoc test_fun_#t~mem23; 5342#L559-4 assume true; 5426#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 5423#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 5420#L555-2 assume test_fun_#t~short8; 5415#L555-3 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 5414#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 5413#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 5411#L555-7 test_fun_#t~short13 := test_fun_#t~short8; 5402#L555-8 assume test_fun_#t~short13; 5397#L555-18 test_fun_#t~short16 := test_fun_#t~short13; 5395#L555-19 assume test_fun_#t~short16; 5393#L555-20 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-20 5391#L555-21 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-21 5389#L555-22 test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 5387#L555-24 assume !!test_fun_#t~short16;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short12; 5385#L556 SUMMARY for call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 5383#L556-1 SUMMARY for call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 5381#L556-2 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17; 5379#L559 SUMMARY for call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 5377#L559-1 SUMMARY for call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 5375#L559-2 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21; 5372#L560 [2018-11-10 12:01:31,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:31,266 INFO L82 PathProgramCache]: Analyzing trace with hash -236151689, now seen corresponding path program 2 times [2018-11-10 12:01:31,266 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:31,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:31,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:31,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:01:31,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:31,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:31,288 INFO L82 PathProgramCache]: Analyzing trace with hash -2132890767, now seen corresponding path program 1 times [2018-11-10 12:01:31,288 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:31,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:31,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:31,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:01:31,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:31,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:31,303 INFO L82 PathProgramCache]: Analyzing trace with hash 235946983, now seen corresponding path program 2 times [2018-11-10 12:01:31,303 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:31,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:31,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:31,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:01:31,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:31,634 WARN L179 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 102 [2018-11-10 12:01:32,256 WARN L179 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 163 [2018-11-10 12:01:32,387 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-11-10 12:01:32,390 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:01:32,390 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:01:32,390 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:01:32,390 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:01:32,390 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:01:32,390 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:01:32,390 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:01:32,390 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:01:32,390 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.11-alloca_true-termination_true-no-overflow.c.i_Iteration11_Lasso [2018-11-10 12:01:32,390 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:01:32,390 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:01:32,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,678 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 107 [2018-11-10 12:01:32,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:32,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:33,151 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:01:33,151 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:01:33,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:33,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:33,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:33,152 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,153 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:33,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:33,154 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:33,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:33,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:33,155 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:33,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:33,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:33,156 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:33,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:33,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:33,157 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:33,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:33,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:33,158 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:33,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:33,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:33,159 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:33,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:33,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:33,160 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:33,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:33,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:33,161 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,162 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:33,162 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:33,163 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:33,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:33,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:33,164 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:33,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:33,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:33,166 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:33,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:33,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:33,167 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:33,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:33,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:33,168 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,169 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:33,169 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:33,169 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:33,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:33,172 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:33,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:33,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:33,174 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:33,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:33,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:33,175 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:33,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:33,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:33,177 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:33,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:33,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:33,178 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:33,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:33,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:33,180 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:33,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:33,181 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:33,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:33,184 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,185 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:01:33,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,185 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:01:33,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:33,188 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,188 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:01:33,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,189 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:01:33,189 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:33,192 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:33,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:33,194 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:33,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:33,206 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:33,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:33,209 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,210 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:33,210 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:33,214 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:33,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:33,216 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,217 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:01:33,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,218 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:01:33,218 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:33,220 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,222 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:33,222 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:33,225 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:33,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:33,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:33,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:33,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:33,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:33,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:33,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:33,240 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:01:33,248 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 12:01:33,248 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 12:01:33,248 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:01:33,249 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:01:33,249 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:01:33,249 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 Supporting invariants [] [2018-11-10 12:01:33,432 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-10 12:01:33,433 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:01:33,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:33,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:01:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:33,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:01:33,509 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:01:33,520 INFO L477 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 28 treesize of output 46 [2018-11-10 12:01:33,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-11-10 12:01:33,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:33,546 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:01:33,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 24 treesize of output 44 [2018-11-10 12:01:33,556 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-10 12:01:33,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 12:01:33,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 12:01:33,608 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:44 [2018-11-10 12:01:33,797 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:01:33,797 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2018-11-10 12:01:33,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-11-10 12:01:33,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:33,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:33,836 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:01:33,836 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-11-10 12:01:33,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 34 treesize of output 33 [2018-11-10 12:01:33,841 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:33,864 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:33,886 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:01:33,887 INFO L477 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 39 treesize of output 40 [2018-11-10 12:01:33,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 12:01:33,890 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:33,895 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:01:33,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 12:01:33,913 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:125, output treesize:65 [2018-11-10 12:01:34,173 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:01:34,174 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 14 loop predicates [2018-11-10 12:01:34,174 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 209 states and 230 transitions. cyclomatic complexity: 24 Second operand 15 states. [2018-11-10 12:01:35,446 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2018-11-10 12:01:35,534 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 209 states and 230 transitions. cyclomatic complexity: 24. Second operand 15 states. Result 432 states and 470 transitions. Complement of second has 44 states. [2018-11-10 12:01:35,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 1 stem states 21 non-accepting loop states 1 accepting loop states [2018-11-10 12:01:35,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-10 12:01:35,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 129 transitions. [2018-11-10 12:01:35,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 129 transitions. Stem has 50 letters. Loop has 48 letters. [2018-11-10 12:01:35,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:01:35,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 129 transitions. Stem has 98 letters. Loop has 48 letters. [2018-11-10 12:01:35,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:01:35,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 129 transitions. Stem has 50 letters. Loop has 96 letters. [2018-11-10 12:01:35,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:01:35,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 432 states and 470 transitions. [2018-11-10 12:01:35,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 46 [2018-11-10 12:01:35,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 432 states to 352 states and 384 transitions. [2018-11-10 12:01:35,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2018-11-10 12:01:35,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2018-11-10 12:01:35,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 352 states and 384 transitions. [2018-11-10 12:01:35,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:01:35,540 INFO L705 BuchiCegarLoop]: Abstraction has 352 states and 384 transitions. [2018-11-10 12:01:35,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states and 384 transitions. [2018-11-10 12:01:35,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 290. [2018-11-10 12:01:35,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-11-10 12:01:35,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 320 transitions. [2018-11-10 12:01:35,545 INFO L728 BuchiCegarLoop]: Abstraction has 290 states and 320 transitions. [2018-11-10 12:01:35,545 INFO L608 BuchiCegarLoop]: Abstraction has 290 states and 320 transitions. [2018-11-10 12:01:35,545 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 12:01:35,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 290 states and 320 transitions. [2018-11-10 12:01:35,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2018-11-10 12:01:35,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:01:35,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:01:35,546 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:01:35,547 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:01:35,547 INFO L793 eck$LassoCheckResult]: Stem: 6455#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6413#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 6414#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 6419#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 6422#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 6453#L559-4 assume true; 6560#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 6558#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 6551#L555-2 assume test_fun_#t~short8; 6539#L555-3 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 6538#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 6537#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 6535#L555-7 test_fun_#t~short13 := test_fun_#t~short8; 6524#L555-8 assume test_fun_#t~short13; 6519#L555-18 test_fun_#t~short16 := test_fun_#t~short13; 6516#L555-19 assume test_fun_#t~short16; 6511#L555-20 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-20 6505#L555-21 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-21 6500#L555-22 test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 6497#L555-24 assume !!test_fun_#t~short16;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short12; 6494#L556 SUMMARY for call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 6491#L556-1 SUMMARY for call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 6488#L556-2 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17; 6483#L559 SUMMARY for call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 6484#L559-1 SUMMARY for call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 6388#L559-2 assume !(test_fun_#t~mem20 == test_fun_#t~mem21);havoc test_fun_#t~mem20;havoc test_fun_#t~mem21; 6389#L562 SUMMARY for call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L562 6458#L562-1 SUMMARY for call write~int(test_fun_#t~mem23 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L562-1 6570#L562-2 havoc test_fun_#t~mem23; 6567#L559-4 assume true; 6564#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 6559#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 6554#L555-2 assume test_fun_#t~short8; 6547#L555-3 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 6546#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 6545#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 6543#L555-7 test_fun_#t~short13 := test_fun_#t~short8; 6527#L555-8 assume test_fun_#t~short13; 6520#L555-18 test_fun_#t~short16 := test_fun_#t~short13; 6517#L555-19 assume test_fun_#t~short16; 6512#L555-20 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-20 6506#L555-21 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-21 6501#L555-22 test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 6498#L555-24 assume !!test_fun_#t~short16;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short12; 6495#L556 SUMMARY for call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 6492#L556-1 SUMMARY for call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 6489#L556-2 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17; 6485#L559 SUMMARY for call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 6481#L559-1 SUMMARY for call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 6478#L559-2 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21; 6474#L560 SUMMARY for call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 6471#L560-1 SUMMARY for call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560-1 6431#L560-2 havoc test_fun_#t~mem22; 6432#L559-4 assume true; 6403#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 6404#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 6449#L555-2 assume test_fun_#t~short8; 6450#L555-3 [2018-11-10 12:01:35,547 INFO L795 eck$LassoCheckResult]: Loop: 6450#L555-3 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 6456#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 6460#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 6427#L555-7 test_fun_#t~short13 := test_fun_#t~short8; 6428#L555-8 assume test_fun_#t~short13; 6378#L555-18 test_fun_#t~short16 := test_fun_#t~short13; 6379#L555-19 assume test_fun_#t~short16; 6386#L555-20 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-20 6394#L555-21 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-21 6397#L555-22 test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 6408#L555-24 assume !!test_fun_#t~short16;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem9;havoc test_fun_#t~short12; 6437#L556 SUMMARY for call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 6438#L556-1 SUMMARY for call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 6444#L556-2 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17; 6425#L559 SUMMARY for call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 6382#L559-1 SUMMARY for call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 6383#L559-2 assume !(test_fun_#t~mem20 == test_fun_#t~mem21);havoc test_fun_#t~mem20;havoc test_fun_#t~mem21; 6476#L562 SUMMARY for call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L562 6463#L562-1 SUMMARY for call write~int(test_fun_#t~mem23 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L562-1 6464#L562-2 havoc test_fun_#t~mem23; 6399#L559-4 assume true; 6400#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 6410#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 6411#L555-2 assume test_fun_#t~short8; 6450#L555-3 [2018-11-10 12:01:35,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:35,547 INFO L82 PathProgramCache]: Analyzing trace with hash -128446122, now seen corresponding path program 3 times [2018-11-10 12:01:35,547 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:35,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:35,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:35,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:01:35,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:35,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:35,568 INFO L82 PathProgramCache]: Analyzing trace with hash -177015575, now seen corresponding path program 2 times [2018-11-10 12:01:35,569 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:35,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:35,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:35,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:01:35,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:35,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:35,577 INFO L82 PathProgramCache]: Analyzing trace with hash 2129762110, now seen corresponding path program 4 times [2018-11-10 12:01:35,577 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:01:35,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:01:35,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:35,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:01:35,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:01:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:01:35,723 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2018-11-10 12:01:36,660 WARN L179 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 180 [2018-11-10 12:01:36,905 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-11-10 12:01:36,907 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:01:36,907 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:01:36,907 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:01:36,907 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:01:36,907 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:01:36,907 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:01:36,907 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:01:36,907 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:01:36,907 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.11-alloca_true-termination_true-no-overflow.c.i_Iteration12_Lasso [2018-11-10 12:01:36,907 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:01:36,907 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:01:36,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:36,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:36,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:37,195 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2018-11-10 12:01:37,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:37,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:37,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:37,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:37,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:37,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:37,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:37,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:37,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:37,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:37,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:37,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:37,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:37,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:37,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:37,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:37,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:37,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:37,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:37,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:37,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:37,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:37,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:37,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:37,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:37,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:01:37,744 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:01:37,744 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:01:37,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:37,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:37,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:37,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:37,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:37,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:37,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:37,747 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:37,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:37,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:37,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:01:37,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:37,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:37,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:37,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:01:37,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:01:37,748 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:37,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:37,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:37,748 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:01:37,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:37,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:37,749 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:01:37,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:37,753 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:37,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:37,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:37,754 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:01:37,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:37,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:37,755 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:01:37,755 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:37,756 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:37,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:37,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:37,757 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:01:37,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:37,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:37,757 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:01:37,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:37,759 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:37,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:37,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:37,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:37,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:37,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:37,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:37,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:37,764 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:37,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:37,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:37,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:37,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:37,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:37,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:37,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:37,766 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:37,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:37,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:37,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:37,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:37,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:37,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:37,767 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:37,768 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:37,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:37,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:37,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:37,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:37,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:37,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:37,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:37,771 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:01:37,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:01:37,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:01:37,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:01:37,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:01:37,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:01:37,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:01:37,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:01:37,783 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:01:37,789 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 12:01:37,789 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 12:01:37,790 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:01:37,790 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:01:37,790 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:01:37,790 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5 Supporting invariants [] [2018-11-10 12:01:37,871 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-10 12:01:37,875 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:01:37,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:37,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:01:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:37,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:01:38,020 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:01:38,028 INFO L477 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 52 treesize of output 62 [2018-11-10 12:01:38,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 48 treesize of output 52 [2018-11-10 12:01:38,040 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-10 12:01:38,082 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:01:38,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-11-10 12:01:38,083 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:38,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-10 12:01:38,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-10 12:01:38,127 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:79 [2018-11-10 12:01:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:01:38,157 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 10 loop predicates [2018-11-10 12:01:38,157 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 290 states and 320 transitions. cyclomatic complexity: 35 Second operand 12 states. [2018-11-10 12:01:38,379 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 290 states and 320 transitions. cyclomatic complexity: 35. Second operand 12 states. Result 928 states and 1022 transitions. Complement of second has 21 states. [2018-11-10 12:01:38,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2018-11-10 12:01:38,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 12:01:38,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 81 transitions. [2018-11-10 12:01:38,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 81 transitions. Stem has 57 letters. Loop has 24 letters. [2018-11-10 12:01:38,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:01:38,381 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:01:38,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:38,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:01:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:38,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:01:38,534 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:01:38,542 INFO L477 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 52 treesize of output 62 [2018-11-10 12:01:38,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2018-11-10 12:01:38,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:38,567 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:01:38,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 40 treesize of output 52 [2018-11-10 12:01:38,576 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-10 12:01:38,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-10 12:01:38,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-10 12:01:38,630 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:79 [2018-11-10 12:01:38,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:01:38,671 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 10 loop predicates [2018-11-10 12:01:38,671 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 290 states and 320 transitions. cyclomatic complexity: 35 Second operand 12 states. [2018-11-10 12:01:39,302 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 290 states and 320 transitions. cyclomatic complexity: 35. Second operand 12 states. Result 1107 states and 1207 transitions. Complement of second has 39 states. [2018-11-10 12:01:39,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 1 stem states 18 non-accepting loop states 1 accepting loop states [2018-11-10 12:01:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 12:01:39,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 105 transitions. [2018-11-10 12:01:39,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 105 transitions. Stem has 57 letters. Loop has 24 letters. [2018-11-10 12:01:39,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:01:39,303 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:01:39,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:39,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:01:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:39,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:01:39,492 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:01:39,500 INFO L477 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 52 treesize of output 62 [2018-11-10 12:01:39,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2018-11-10 12:01:39,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:01:39,524 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:01:39,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 40 treesize of output 52 [2018-11-10 12:01:39,534 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-10 12:01:39,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-10 12:01:39,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-10 12:01:39,583 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:79 [2018-11-10 12:01:39,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:01:39,612 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 10 loop predicates [2018-11-10 12:01:39,612 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 290 states and 320 transitions. cyclomatic complexity: 35 Second operand 12 states. [2018-11-10 12:01:39,821 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 290 states and 320 transitions. cyclomatic complexity: 35. Second operand 12 states. Result 643 states and 708 transitions. Complement of second has 22 states. [2018-11-10 12:01:39,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2018-11-10 12:01:39,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 12:01:39,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 87 transitions. [2018-11-10 12:01:39,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 87 transitions. Stem has 57 letters. Loop has 24 letters. [2018-11-10 12:01:39,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:01:39,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 87 transitions. Stem has 81 letters. Loop has 24 letters. [2018-11-10 12:01:39,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:01:39,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 87 transitions. Stem has 57 letters. Loop has 48 letters. [2018-11-10 12:01:39,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:01:39,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 643 states and 708 transitions. [2018-11-10 12:01:39,827 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:01:39,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 643 states to 0 states and 0 transitions. [2018-11-10 12:01:39,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:01:39,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:01:39,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:01:39,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:01:39,827 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:01:39,827 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:01:39,827 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:01:39,827 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 12:01:39,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:01:39,827 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:01:39,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 12:01:39,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:01:39 BoogieIcfgContainer [2018-11-10 12:01:39,833 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 12:01:39,833 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:01:39,833 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:01:39,834 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:01:39,834 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:01:20" (3/4) ... [2018-11-10 12:01:39,837 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 12:01:39,837 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:01:39,838 INFO L168 Benchmark]: Toolchain (without parser) took 20347.14 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 545.3 MB). Free memory was 956.4 MB in the beginning and 1.4 GB in the end (delta: -418.2 MB). Peak memory consumption was 127.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:01:39,838 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:01:39,839 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.53 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 935.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:01:39,839 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 935.0 MB in the beginning and 1.1 GB in the end (delta: -214.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:01:39,839 INFO L168 Benchmark]: Boogie Preprocessor took 16.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-10 12:01:39,840 INFO L168 Benchmark]: RCFGBuilder took 269.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:01:39,840 INFO L168 Benchmark]: BuchiAutomizer took 19675.74 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 390.6 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -259.8 MB). Peak memory consumption was 130.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:01:39,840 INFO L168 Benchmark]: Witness Printer took 3.89 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:01:39,842 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 309.53 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 935.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 935.0 MB in the beginning and 1.1 GB in the end (delta: -214.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 269.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19675.74 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 390.6 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -259.8 MB). Peak memory consumption was 130.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.89 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 12 terminating modules (7 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 11 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 8 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 11 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 23 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 11 locations. 7 modules have a trivial ranking function, the largest among these consists of 22 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.6s and 13 iterations. TraceHistogramMax:3. Analysis of lassos took 12.3s. Construction of modules took 1.6s. Büchi inclusion checks took 5.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 371 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 290 states and ocurred in iteration 11. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 6/21 HoareTripleCheckerStatistics: 743 SDtfs, 1405 SDslu, 2535 SDs, 0 SdLazy, 3279 SolverSat, 155 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc2 concLT0 SILN0 SILU2 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital552 mio100 ax104 hnf100 lsp93 ukn58 mio100 lsp33 div100 bol100 ite100 ukn100 eq197 hnf87 smp95 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...