./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca_false-termination.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_25787910-0591-4c47-9523-8140bc150d56/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_25787910-0591-4c47-9523-8140bc150d56/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_25787910-0591-4c47-9523-8140bc150d56/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_25787910-0591-4c47-9523-8140bc150d56/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca_false-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_25787910-0591-4c47-9523-8140bc150d56/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_25787910-0591-4c47-9523-8140bc150d56/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 18edad3aefc49839189b8c997aba3dd32264f7ca ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:06:11,058 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:06:11,059 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:06:11,071 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:06:11,072 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:06:11,073 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:06:11,076 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:06:11,078 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:06:11,080 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:06:11,083 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:06:11,085 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:06:11,085 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:06:11,087 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:06:11,089 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:06:11,096 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:06:11,096 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:06:11,097 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:06:11,098 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:06:11,099 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:06:11,100 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:06:11,104 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:06:11,105 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:06:11,108 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:06:11,110 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:06:11,111 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:06:11,112 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:06:11,113 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:06:11,113 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:06:11,114 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:06:11,115 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:06:11,115 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:06:11,115 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:06:11,116 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:06:11,116 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:06:11,116 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:06:11,120 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:06:11,122 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_25787910-0591-4c47-9523-8140bc150d56/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:06:11,135 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:06:11,138 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:06:11,140 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:06:11,141 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:06:11,141 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:06:11,142 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:06:11,142 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:06:11,143 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:06:11,143 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:06:11,143 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:06:11,143 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:06:11,144 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:06:11,144 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:06:11,144 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:06:11,144 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:06:11,144 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:06:11,144 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:06:11,144 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:06:11,145 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:06:11,145 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:06:11,145 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:06:11,145 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:06:11,145 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:06:11,145 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:06:11,146 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:06:11,146 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:06:11,146 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:06:11,147 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:06:11,147 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_25787910-0591-4c47-9523-8140bc150d56/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 -> 18edad3aefc49839189b8c997aba3dd32264f7ca [2018-10-27 06:06:11,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:06:11,189 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:06:11,193 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:06:11,195 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:06:11,196 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:06:11,196 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_25787910-0591-4c47-9523-8140bc150d56/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca_false-termination.c.i [2018-10-27 06:06:11,250 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25787910-0591-4c47-9523-8140bc150d56/bin-2019/uautomizer/data/05b91f937/ab20103162164f5bb492092c8223504a/FLAG6b59f151c [2018-10-27 06:06:11,686 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:06:11,687 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_25787910-0591-4c47-9523-8140bc150d56/sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca_false-termination.c.i [2018-10-27 06:06:11,698 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25787910-0591-4c47-9523-8140bc150d56/bin-2019/uautomizer/data/05b91f937/ab20103162164f5bb492092c8223504a/FLAG6b59f151c [2018-10-27 06:06:11,711 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_25787910-0591-4c47-9523-8140bc150d56/bin-2019/uautomizer/data/05b91f937/ab20103162164f5bb492092c8223504a [2018-10-27 06:06:11,714 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:06:11,716 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:06:11,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:11,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:06:11,720 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:06:11,720 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:11" (1/1) ... [2018-10-27 06:06:11,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46d0f8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:11, skipping insertion in model container [2018-10-27 06:06:11,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:11" (1/1) ... [2018-10-27 06:06:11,731 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:06:11,766 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:06:12,020 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:12,031 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:06:12,078 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:12,125 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:06:12,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:12 WrapperNode [2018-10-27 06:06:12,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:12,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:12,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:06:12,126 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:06:12,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:12" (1/1) ... [2018-10-27 06:06:12,152 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:12" (1/1) ... [2018-10-27 06:06:12,239 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:12,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:06:12,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:06:12,240 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:06:12,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:12" (1/1) ... [2018-10-27 06:06:12,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:12" (1/1) ... [2018-10-27 06:06:12,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:12" (1/1) ... [2018-10-27 06:06:12,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:12" (1/1) ... [2018-10-27 06:06:12,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:12" (1/1) ... [2018-10-27 06:06:12,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:12" (1/1) ... [2018-10-27 06:06:12,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:12" (1/1) ... [2018-10-27 06:06:12,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:06:12,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:06:12,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:06:12,289 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:06:12,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25787910-0591-4c47-9523-8140bc150d56/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-10-27 06:06:12,346 INFO L130 BoogieDeclarations]: Found specification of procedure new_ll [2018-10-27 06:06:12,346 INFO L138 BoogieDeclarations]: Found implementation of procedure new_ll [2018-10-27 06:06:12,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:06:12,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-10-27 06:06:12,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-10-27 06:06:12,347 INFO L130 BoogieDeclarations]: Found specification of procedure length [2018-10-27 06:06:12,347 INFO L138 BoogieDeclarations]: Found implementation of procedure length [2018-10-27 06:06:12,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:06:12,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:06:12,770 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:06:12,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:12 BoogieIcfgContainer [2018-10-27 06:06:12,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:06:12,771 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:06:12,771 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:06:12,775 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:06:12,776 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:12,776 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:06:11" (1/3) ... [2018-10-27 06:06:12,777 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6411f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:12, skipping insertion in model container [2018-10-27 06:06:12,777 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:12,777 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:12" (2/3) ... [2018-10-27 06:06:12,777 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6411f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:12, skipping insertion in model container [2018-10-27 06:06:12,777 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:12,778 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:12" (3/3) ... [2018-10-27 06:06:12,779 INFO L375 chiAutomizerObserver]: Analyzing ICFG ll_append-alloca_false-termination.c.i [2018-10-27 06:06:12,840 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:06:12,840 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:06:12,841 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:06:12,841 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:06:12,841 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:06:12,841 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:06:12,841 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:06:12,841 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:06:12,841 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:06:12,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2018-10-27 06:06:12,893 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-10-27 06:06:12,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:12,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:12,908 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:06:12,908 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:06:12,908 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:06:12,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2018-10-27 06:06:12,912 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-10-27 06:06:12,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:12,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:12,913 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:06:12,914 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:06:12,922 INFO L793 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 15#L574true assume !(main_~n~0 < 1); 10#L577true call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 18#new_llENTRYtrue [2018-10-27 06:06:12,927 INFO L795 eck$LassoCheckResult]: Loop: 18#new_llENTRYtrue ~n := #in~n; 36#L548true assume !(~n == 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 12;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];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset; 8#L551true SUMMARY for call write~int(~n, ~head~0.base, ~head~0.offset + 0, 4); srcloc: L551 4#L551-1true call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 18#new_llENTRYtrue [2018-10-27 06:06:12,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:12,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1510600, now seen corresponding path program 1 times [2018-10-27 06:06:12,936 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:12,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:12,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:12,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:12,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:13,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:13,059 INFO L82 PathProgramCache]: Analyzing trace with hash 927579, now seen corresponding path program 1 times [2018-10-27 06:06:13,059 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:13,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:13,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:13,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:13,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:13,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:13,101 INFO L82 PathProgramCache]: Analyzing trace with hash -793544542, now seen corresponding path program 1 times [2018-10-27 06:06:13,101 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:13,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:13,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:13,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:13,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:13,579 WARN L179 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2018-10-27 06:06:13,781 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-10-27 06:06:13,970 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-10-27 06:06:14,257 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-27 06:06:14,378 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-27 06:06:14,461 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:14,462 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:14,462 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:14,463 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:14,463 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:14,463 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:14,463 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:14,463 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:14,463 INFO L131 ssoRankerPreferences]: Filename of dumped script: ll_append-alloca_false-termination.c.i_Iteration1_Lasso [2018-10-27 06:06:14,464 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:14,464 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:14,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,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-10-27 06:06:14,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,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-10-27 06:06:14,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-10-27 06:06:14,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-10-27 06:06:14,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:14,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:15,034 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:15,039 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:15,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-10-27 06:06:15,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,049 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:15,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,052 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,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-10-27 06:06:15,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,056 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,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-10-27 06:06:15,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,059 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:15,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,063 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:15,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,066 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,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-10-27 06:06:15,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,069 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:15,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,072 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,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-10-27 06:06:15,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,080 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,081 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:15,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,091 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:15,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,095 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:15,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,098 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:15,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,101 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:15,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,105 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:15,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,108 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:15,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,111 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:15,111 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:15,116 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:15,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,119 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:15,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,122 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:15,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,126 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:15,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,129 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:15,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,133 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:15,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,136 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:15,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,140 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:15,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,143 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:15,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,146 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:15,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,153 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,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-10-27 06:06:15,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,163 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,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-10-27 06:06:15,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,167 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,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-10-27 06:06:15,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,170 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,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-10-27 06:06:15,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:15,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,178 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:15,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:15,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:15,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:15,187 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,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-10-27 06:06:15,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:15,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,192 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:15,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,192 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:15,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:15,194 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:15,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-10-27 06:06:15,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:15,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:15,195 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:15,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:15,202 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-10-27 06:06:15,202 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-10-27 06:06:15,279 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:15,306 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:06:15,307 INFO L444 ModelExtractionUtils]: 7 out of 11 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:06:15,309 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:15,313 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2018-10-27 06:06:15,314 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:15,314 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(new_ll_#in~n) = 1*new_ll_#in~n Supporting invariants [1*new_ll_#in~n >= 0] [2018-10-27 06:06:15,329 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2018-10-27 06:06:15,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:15,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:15,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:15,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:15,493 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-10-27 06:06:15,495 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states. Second operand 5 states. [2018-10-27 06:06:15,647 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states.. Second operand 5 states. Result 55 states and 64 transitions. Complement of second has 13 states. [2018-10-27 06:06:15,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:15,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-27 06:06:15,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-10-27 06:06:15,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 4 letters. Loop has 4 letters. [2018-10-27 06:06:15,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:15,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 8 letters. Loop has 4 letters. [2018-10-27 06:06:15,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:15,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 4 letters. Loop has 8 letters. [2018-10-27 06:06:15,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:15,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 64 transitions. [2018-10-27 06:06:15,659 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-10-27 06:06:15,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 37 states and 45 transitions. [2018-10-27 06:06:15,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-10-27 06:06:15,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-10-27 06:06:15,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 45 transitions. [2018-10-27 06:06:15,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:15,670 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-10-27 06:06:15,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 45 transitions. [2018-10-27 06:06:15,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2018-10-27 06:06:15,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-27 06:06:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-10-27 06:06:15,703 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-10-27 06:06:15,703 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-10-27 06:06:15,703 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:06:15,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 40 transitions. [2018-10-27 06:06:15,704 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-10-27 06:06:15,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:15,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:15,705 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:15,706 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:06:15,706 INFO L793 eck$LassoCheckResult]: Stem: 190#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 177#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 178#L574 assume !(main_~n~0 < 1); 161#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 172#new_llENTRY ~n := #in~n; 182#L548 assume ~n == 0;#res.base, #res.offset := 0, 0; 160#new_llFINAL assume true; 162#new_llEXIT >#64#return; 173#L577-1 main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;assume { :begin_inline_append } true;append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset;havoc append_#res.base, append_#res.offset;havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset;append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset;append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; 174#L563 assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; 180#L566-4 [2018-10-27 06:06:15,706 INFO L795 eck$LassoCheckResult]: Loop: 180#L566-4 assume true; 175#L566-1 SUMMARY for call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, append_~x.offset + 4, 8); srcloc: L566-1 176#L566-2 assume !!(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0);havoc append_#t~mem6.base, append_#t~mem6.offset; 186#L567 SUMMARY for call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~x.base, append_~x.offset + 4, 8); srcloc: L567 187#L567-1 append_~x.base, append_~x.offset := append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem7.base, append_#t~mem7.offset; 180#L566-4 [2018-10-27 06:06:15,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:15,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1907075175, now seen corresponding path program 1 times [2018-10-27 06:06:15,707 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:15,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:15,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:15,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:15,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:15,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:15,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:06:15,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:06:15,807 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:06:15,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:15,807 INFO L82 PathProgramCache]: Analyzing trace with hash 64005002, now seen corresponding path program 1 times [2018-10-27 06:06:15,807 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:15,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:15,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:15,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:15,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:15,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:06:15,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:06:15,905 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-10-27 06:06:15,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:15,938 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-10-27 06:06:15,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 06:06:15,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 43 transitions. [2018-10-27 06:06:15,940 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-10-27 06:06:15,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 43 transitions. [2018-10-27 06:06:15,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-10-27 06:06:15,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-10-27 06:06:15,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2018-10-27 06:06:15,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:15,942 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-10-27 06:06:15,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2018-10-27 06:06:15,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-10-27 06:06:15,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-27 06:06:15,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-10-27 06:06:15,945 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-10-27 06:06:15,945 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-10-27 06:06:15,945 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:06:15,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2018-10-27 06:06:15,946 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-10-27 06:06:15,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:15,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:15,947 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:15,947 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:06:15,947 INFO L793 eck$LassoCheckResult]: Stem: 270#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 257#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 258#L574 assume !(main_~n~0 < 1); 243#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 252#new_llENTRY ~n := #in~n; 261#L548 assume ~n == 0;#res.base, #res.offset := 0, 0; 272#new_llFINAL assume true; 271#new_llEXIT >#64#return; 253#L577-1 main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;assume { :begin_inline_append } true;append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset;havoc append_#res.base, append_#res.offset;havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset;append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset;append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; 254#L563 assume append_~x.base == 0 && append_~x.offset == 0;append_#res.base, append_#res.offset := append_~y.base, append_~y.offset; 250#L569 main_#t~ret10.base, main_#t~ret10.offset := append_#res.base, append_#res.offset;assume { :end_inline_append } true;main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset; 247#L579 call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset);< 245#lengthENTRY [2018-10-27 06:06:15,947 INFO L795 eck$LassoCheckResult]: Loop: 245#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 248#L557 assume !(~xs.base == 0 && ~xs.offset == 0); 259#L559 SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, ~xs.offset + 4, 8); srcloc: L559 246#L559-1 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 245#lengthENTRY [2018-10-27 06:06:15,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:15,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1251792431, now seen corresponding path program 1 times [2018-10-27 06:06:15,948 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:15,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:15,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:15,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:15,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:16,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:16,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:06:16,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:06:16,030 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:06:16,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:16,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1235411, now seen corresponding path program 1 times [2018-10-27 06:06:16,030 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:16,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:16,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:16,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:16,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:16,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:06:16,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:06:16,168 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-10-27 06:06:16,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:16,207 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-10-27 06:06:16,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 06:06:16,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 38 transitions. [2018-10-27 06:06:16,209 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-10-27 06:06:16,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 35 transitions. [2018-10-27 06:06:16,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-10-27 06:06:16,211 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-10-27 06:06:16,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2018-10-27 06:06:16,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:16,211 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-10-27 06:06:16,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2018-10-27 06:06:16,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-27 06:06:16,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-27 06:06:16,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-10-27 06:06:16,214 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-10-27 06:06:16,214 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-10-27 06:06:16,215 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:06:16,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2018-10-27 06:06:16,215 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-10-27 06:06:16,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:16,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:16,216 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:16,216 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:06:16,217 INFO L793 eck$LassoCheckResult]: Stem: 348#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 337#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 338#L574 assume !(main_~n~0 < 1); 321#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 332#new_llENTRY ~n := #in~n; 341#L548 assume !(~n == 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 12;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];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset; 331#L551 SUMMARY for call write~int(~n, ~head~0.base, ~head~0.offset + 0, 4); srcloc: L551 320#L551-1 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 322#new_llENTRY ~n := #in~n; 342#L548 assume ~n == 0;#res.base, #res.offset := 0, 0; 350#new_llFINAL assume true; 349#new_llEXIT >#60#return; 346#L552 SUMMARY for call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, ~head~0.offset + 4, 8); srcloc: L552 343#L552-1 havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 323#new_llFINAL assume true; 324#new_llEXIT >#64#return; 333#L577-1 main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;assume { :begin_inline_append } true;append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset;havoc append_#res.base, append_#res.offset;havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset;append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset;append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; 334#L563 assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; 339#L566-4 [2018-10-27 06:06:16,217 INFO L795 eck$LassoCheckResult]: Loop: 339#L566-4 assume true; 335#L566-1 SUMMARY for call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, append_~x.offset + 4, 8); srcloc: L566-1 336#L566-2 assume !!(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0);havoc append_#t~mem6.base, append_#t~mem6.offset; 344#L567 SUMMARY for call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~x.base, append_~x.offset + 4, 8); srcloc: L567 345#L567-1 append_~x.base, append_~x.offset := append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem7.base, append_#t~mem7.offset; 339#L566-4 [2018-10-27 06:06:16,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:16,217 INFO L82 PathProgramCache]: Analyzing trace with hash 260836789, now seen corresponding path program 1 times [2018-10-27 06:06:16,217 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:16,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:16,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:16,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:16,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:16,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:16,245 INFO L82 PathProgramCache]: Analyzing trace with hash 64005002, now seen corresponding path program 2 times [2018-10-27 06:06:16,245 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:16,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:16,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:16,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:16,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:16,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:16,252 INFO L82 PathProgramCache]: Analyzing trace with hash 770508374, now seen corresponding path program 1 times [2018-10-27 06:06:16,253 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:16,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:16,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:16,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:16,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:16,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 06:06:16,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:06:16,513 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25787910-0591-4c47-9523-8140bc150d56/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-10-27 06:06:16,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:16,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:16,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 13 treesize of output 10 [2018-10-27 06:06:16,633 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-10-27 06:06:16,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:16,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:16,648 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 13 treesize of output 10 [2018-10-27 06:06:16,652 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-10-27 06:06:16,652 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:16,654 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:16,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:16,659 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-10-27 06:06:16,735 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-10-27 06:06:16,743 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 11 treesize of output 3 [2018-10-27 06:06:16,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:16,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:16,772 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-10-27 06:06:16,778 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 11 treesize of output 3 [2018-10-27 06:06:16,778 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:16,780 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:16,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:16,783 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-10-27 06:06:16,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 06:06:16,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:06:16,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-10-27 06:06:17,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 06:06:17,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-10-27 06:06:17,001 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. cyclomatic complexity: 7 Second operand 11 states. [2018-10-27 06:06:17,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:17,133 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-10-27 06:06:17,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 06:06:17,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 49 transitions. [2018-10-27 06:06:17,135 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-10-27 06:06:17,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 49 transitions. [2018-10-27 06:06:17,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-10-27 06:06:17,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-10-27 06:06:17,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 49 transitions. [2018-10-27 06:06:17,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:17,137 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-10-27 06:06:17,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 49 transitions. [2018-10-27 06:06:17,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-10-27 06:06:17,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-27 06:06:17,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-10-27 06:06:17,141 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-10-27 06:06:17,141 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-10-27 06:06:17,141 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:06:17,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 46 transitions. [2018-10-27 06:06:17,142 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-10-27 06:06:17,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:17,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:17,143 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:17,143 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:06:17,143 INFO L793 eck$LassoCheckResult]: Stem: 510#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 497#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 498#L574 assume !(main_~n~0 < 1); 487#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 492#new_llENTRY ~n := #in~n; 501#L548 assume !(~n == 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 12;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];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset; 491#L551 SUMMARY for call write~int(~n, ~head~0.base, ~head~0.offset + 0, 4); srcloc: L551 481#L551-1 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 488#new_llENTRY ~n := #in~n; 502#L548 assume ~n == 0;#res.base, #res.offset := 0, 0; 480#new_llFINAL assume true; 482#new_llEXIT >#60#return; 507#L552 SUMMARY for call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, ~head~0.offset + 4, 8); srcloc: L552 503#L552-1 havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 504#new_llFINAL assume true; 517#new_llEXIT >#64#return; 493#L577-1 main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;assume { :begin_inline_append } true;append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset;havoc append_#res.base, append_#res.offset;havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset;append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset;append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; 494#L563 assume append_~x.base == 0 && append_~x.offset == 0;append_#res.base, append_#res.offset := append_~y.base, append_~y.offset; 490#L569 main_#t~ret10.base, main_#t~ret10.offset := append_#res.base, append_#res.offset;assume { :end_inline_append } true;main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset; 485#L579 call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset);< 483#lengthENTRY [2018-10-27 06:06:17,143 INFO L795 eck$LassoCheckResult]: Loop: 483#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 486#L557 assume !(~xs.base == 0 && ~xs.offset == 0); 500#L559 SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, ~xs.offset + 4, 8); srcloc: L559 484#L559-1 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 483#lengthENTRY [2018-10-27 06:06:17,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:17,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1556050847, now seen corresponding path program 1 times [2018-10-27 06:06:17,144 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:17,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:17,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:17,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:17,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:17,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 06:06:17,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:06:17,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 06:06:17,231 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:06:17,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:17,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1235411, now seen corresponding path program 2 times [2018-10-27 06:06:17,232 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:17,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:17,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:17,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:17,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:17,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:06:17,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:06:17,441 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-10-27 06:06:17,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:17,472 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-10-27 06:06:17,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 06:06:17,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 54 transitions. [2018-10-27 06:06:17,474 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-10-27 06:06:17,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 54 transitions. [2018-10-27 06:06:17,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-10-27 06:06:17,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-10-27 06:06:17,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 54 transitions. [2018-10-27 06:06:17,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:17,476 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-10-27 06:06:17,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 54 transitions. [2018-10-27 06:06:17,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2018-10-27 06:06:17,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-27 06:06:17,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-10-27 06:06:17,480 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-10-27 06:06:17,480 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-10-27 06:06:17,480 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:06:17,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 44 transitions. [2018-10-27 06:06:17,485 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-10-27 06:06:17,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:17,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:17,486 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:17,486 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:06:17,486 INFO L793 eck$LassoCheckResult]: Stem: 612#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 598#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 599#L574 assume !(main_~n~0 < 1); 582#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 593#new_llENTRY ~n := #in~n; 603#L548 assume !(~n == 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 12;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];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset; 592#L551 SUMMARY for call write~int(~n, ~head~0.base, ~head~0.offset + 0, 4); srcloc: L551 581#L551-1 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 583#new_llENTRY ~n := #in~n; 604#L548 assume ~n == 0;#res.base, #res.offset := 0, 0; 584#new_llFINAL assume true; 585#new_llEXIT >#60#return; 613#L552 SUMMARY for call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, ~head~0.offset + 4, 8); srcloc: L552 620#L552-1 havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 619#new_llFINAL assume true; 618#new_llEXIT >#64#return; 617#L577-1 main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;assume { :begin_inline_append } true;append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset;havoc append_#res.base, append_#res.offset;havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset;append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset;append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; 600#L563 assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; 601#L566-4 assume true; 596#L566-1 SUMMARY for call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, append_~x.offset + 4, 8); srcloc: L566-1 597#L566-2 assume !(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0);havoc append_#t~mem6.base, append_#t~mem6.offset; 611#L566-5 SUMMARY for call write~$Pointer$(append_~y.base, append_~y.offset, append_~x.base, append_~x.offset + 4, 8); srcloc: L566-5 590#L568 append_#res.base, append_#res.offset := append_~s~0.base, append_~s~0.offset; 591#L569 main_#t~ret10.base, main_#t~ret10.offset := append_#res.base, append_#res.offset;assume { :end_inline_append } true;main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset; 588#L579 call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset);< 586#lengthENTRY [2018-10-27 06:06:17,486 INFO L795 eck$LassoCheckResult]: Loop: 586#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 589#L557 assume !(~xs.base == 0 && ~xs.offset == 0); 602#L559 SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, ~xs.offset + 4, 8); srcloc: L559 587#L559-1 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 586#lengthENTRY [2018-10-27 06:06:17,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:17,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1722480928, now seen corresponding path program 1 times [2018-10-27 06:06:17,486 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:17,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:17,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:17,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:17,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:17,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:17,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1235411, now seen corresponding path program 3 times [2018-10-27 06:06:17,525 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:17,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:17,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:17,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:17,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:17,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:17,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1202836622, now seen corresponding path program 1 times [2018-10-27 06:06:17,533 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:17,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:17,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:17,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:17,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:17,735 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-27 06:06:18,052 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 98 [2018-10-27 06:06:18,329 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-10-27 06:06:18,749 WARN L179 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 139 [2018-10-27 06:06:18,893 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-10-27 06:06:19,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:06:19 BoogieIcfgContainer [2018-10-27 06:06:19,055 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:06:19,055 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:06:19,056 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:06:19,056 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:06:19,056 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:12" (3/4) ... [2018-10-27 06:06:19,062 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-10-27 06:06:19,125 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_25787910-0591-4c47-9523-8140bc150d56/bin-2019/uautomizer/witness.graphml [2018-10-27 06:06:19,125 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:06:19,126 INFO L168 Benchmark]: Toolchain (without parser) took 7411.07 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 272.1 MB). Free memory was 957.0 MB in the beginning and 1.3 GB in the end (delta: -304.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:06:19,127 INFO L168 Benchmark]: CDTParser took 0.17 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-10-27 06:06:19,127 INFO L168 Benchmark]: CACSL2BoogieTranslator took 409.42 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 935.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:19,127 INFO L168 Benchmark]: Boogie Procedure Inliner took 113.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 935.5 MB in the beginning and 1.2 GB in the end (delta: -232.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:19,128 INFO L168 Benchmark]: Boogie Preprocessor took 48.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:19,128 INFO L168 Benchmark]: RCFGBuilder took 481.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:19,132 INFO L168 Benchmark]: BuchiAutomizer took 6284.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 106.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -130.1 MB). Peak memory consumption was 359.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:19,132 INFO L168 Benchmark]: Witness Printer took 69.63 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:19,136 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 409.42 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 935.5 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 113.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 935.5 MB in the beginning and 1.2 GB in the end (delta: -232.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 481.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6284.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 106.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -130.1 MB). Peak memory consumption was 359.0 MB. Max. memory is 11.5 GB. * Witness Printer took 69.63 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(n) and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. The remainder module has 40 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 17 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 40 states and ocurred in iteration 4. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 112 SDtfs, 57 SDslu, 348 SDs, 0 SdLazy, 180 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital106 mio100 ax100 hnf100 lsp71 ukn39 mio100 lsp46 div100 bol100 ite100 ukn100 eq214 hnf86 smp100 dnf130 smp100 tf100 neg94 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 118ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 555]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {x=0, x=0, y_length=0, NULL=0, y=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4723e430=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@ad96b0f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4d1cb6d9=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4d1cb6d9=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@36fd0e8=0, xs=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@40e4ada7=0, NULL=0, y=0, y=0, \result=0, x=0, y=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@28d81bc7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6cec7ef2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6cec7ef2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@ad96b0f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d5741d4=0, x=0, y=0, n=0, NULL=0, y=0, xs=2, \result=0, \result=0, NULL=0, xs=0, xs=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@36fd0e8=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4723e430=0, x=0, NULL=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 555]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L573] int n = __VERIFIER_nondet_int(); [L574] COND FALSE !(n < 1) [L577] CALL, EXPR new_ll(n) [L548] COND FALSE !(n == 0) [L550] EXPR, FCALL malloc(sizeof(node_t)) [L550] node_t* head = malloc(sizeof(node_t)); [L551] FCALL head->val = n [L552] CALL, EXPR new_ll(n-1) [L548] COND TRUE n == 0 [L549] RET return ((void *)0); [L552] EXPR new_ll(n-1) [L552] FCALL head->next = new_ll(n-1) [L553] RET return head; [L577] EXPR new_ll(n) [L577] node_t* x = new_ll(n); [L578] CALL, EXPR append(x, x) [L563] COND FALSE !(x == ((void *)0)) [L565] node_t* s = x; [L566] EXPR, FCALL x->next [L566] COND FALSE !(x->next != ((void *)0)) [L568] FCALL x->next = y [L569] RET return s; [L578] EXPR append(x, x) [L578] node_t* y = append(x, x); [L579] CALL length(y) Loop: [L557] COND FALSE !(xs == ((void *)0)) [L559] EXPR, FCALL xs->next [L559] CALL length(xs->next) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...