./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-linkedlists/ll_append-alloca_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-linkedlists/ll_append-alloca_false-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.24-2e94e6a [2019-01-01 21:54:41,765 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:54:41,767 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:54:41,787 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:54:41,788 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:54:41,790 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:54:41,794 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:54:41,798 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:54:41,801 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:54:41,804 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:54:41,807 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:54:41,808 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:54:41,809 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:54:41,819 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:54:41,820 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:54:41,825 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:54:41,828 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:54:41,829 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:54:41,831 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:54:41,836 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:54:41,837 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:54:41,842 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:54:41,845 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:54:41,847 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:54:41,847 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:54:41,848 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:54:41,853 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:54:41,854 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:54:41,855 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:54:41,857 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:54:41,857 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:54:41,858 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:54:41,858 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:54:41,858 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:54:41,861 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:54:41,862 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:54:41,862 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:54:41,896 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:54:41,896 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:54:41,897 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:54:41,898 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:54:41,898 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:54:41,898 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:54:41,899 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:54:41,899 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:54:41,899 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:54:41,899 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:54:41,899 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:54:41,899 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:54:41,900 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:54:41,900 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:54:41,900 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:54:41,900 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:54:41,900 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:54:41,900 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:54:41,902 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:54:41,902 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:54:41,903 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:54:41,903 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:54:41,903 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:54:41,903 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:54:41,903 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:54:41,903 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:54:41,904 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:54:41,905 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:54:41,906 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:54:41,906 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2019-01-01 21:54:41,948 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:54:41,965 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:54:41,972 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:54:41,974 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:54:41,975 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:54:41,976 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-linkedlists/ll_append-alloca_false-termination.c.i [2019-01-01 21:54:42,045 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/204979a33/f3e6a8edbee0462fbd28fc868bb9edc9/FLAGbb7b343d0 [2019-01-01 21:54:42,638 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:54:42,639 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-linkedlists/ll_append-alloca_false-termination.c.i [2019-01-01 21:54:42,659 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/204979a33/f3e6a8edbee0462fbd28fc868bb9edc9/FLAGbb7b343d0 [2019-01-01 21:54:42,893 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/204979a33/f3e6a8edbee0462fbd28fc868bb9edc9 [2019-01-01 21:54:42,897 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:54:42,899 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:54:42,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:54:42,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:54:42,904 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:54:42,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:54:42" (1/1) ... [2019-01-01 21:54:42,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5255592d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:42, skipping insertion in model container [2019-01-01 21:54:42,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:54:42" (1/1) ... [2019-01-01 21:54:42,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:54:42,962 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:54:43,365 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:54:43,383 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:54:43,429 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:54:43,497 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:54:43,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:43 WrapperNode [2019-01-01 21:54:43,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:54:43,499 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:54:43,499 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:54:43,499 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:54:43,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:43" (1/1) ... [2019-01-01 21:54:43,601 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:43" (1/1) ... [2019-01-01 21:54:43,626 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:54:43,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:54:43,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:54:43,627 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:54:43,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:43" (1/1) ... [2019-01-01 21:54:43,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:43" (1/1) ... [2019-01-01 21:54:43,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:43" (1/1) ... [2019-01-01 21:54:43,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:43" (1/1) ... [2019-01-01 21:54:43,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:43" (1/1) ... [2019-01-01 21:54:43,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:43" (1/1) ... [2019-01-01 21:54:43,657 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:43" (1/1) ... [2019-01-01 21:54:43,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:54:43,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:54:43,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:54:43,662 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:54:43,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 21:54:43,737 INFO L130 BoogieDeclarations]: Found specification of procedure new_ll [2019-01-01 21:54:43,738 INFO L138 BoogieDeclarations]: Found implementation of procedure new_ll [2019-01-01 21:54:43,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:54:43,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 21:54:43,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 21:54:43,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 21:54:43,739 INFO L130 BoogieDeclarations]: Found specification of procedure length [2019-01-01 21:54:43,739 INFO L138 BoogieDeclarations]: Found implementation of procedure length [2019-01-01 21:54:43,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:54:43,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:54:44,235 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:54:44,236 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-01 21:54:44,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:54:44 BoogieIcfgContainer [2019-01-01 21:54:44,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:54:44,238 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:54:44,238 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:54:44,241 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:54:44,242 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:54:44,242 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:54:42" (1/3) ... [2019-01-01 21:54:44,243 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a02e9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:54:44, skipping insertion in model container [2019-01-01 21:54:44,244 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:54:44,244 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:43" (2/3) ... [2019-01-01 21:54:44,244 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a02e9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:54:44, skipping insertion in model container [2019-01-01 21:54:44,245 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:54:44,245 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:54:44" (3/3) ... [2019-01-01 21:54:44,248 INFO L375 chiAutomizerObserver]: Analyzing ICFG ll_append-alloca_false-termination.c.i [2019-01-01 21:54:44,311 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:54:44,311 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:54:44,312 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:54:44,312 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:54:44,312 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:54:44,312 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:54:44,312 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:54:44,312 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:54:44,313 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:54:44,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-01-01 21:54:44,357 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-01 21:54:44,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:54:44,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:54:44,368 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:54:44,368 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:54:44,368 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:54:44,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-01-01 21:54:44,372 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-01 21:54:44,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:54:44,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:54:44,373 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:54:44,373 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:54:44,384 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true 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; 12#L574true assume !(main_~n~0 < 1); 7#L577true call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 15#new_llENTRYtrue [2019-01-01 21:54:44,384 INFO L796 eck$LassoCheckResult]: Loop: 15#new_llENTRYtrue ~n := #in~n; 29#L548true assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 22#L552true call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 15#new_llENTRYtrue [2019-01-01 21:54:44,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:44,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1418244, now seen corresponding path program 1 times [2019-01-01 21:54:44,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:44,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:44,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:44,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:44,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:44,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:44,528 INFO L82 PathProgramCache]: Analyzing trace with hash 29967, now seen corresponding path program 1 times [2019-01-01 21:54:44,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:44,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:44,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:44,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:44,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:44,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:44,573 INFO L82 PathProgramCache]: Analyzing trace with hash -698765780, now seen corresponding path program 1 times [2019-01-01 21:54:44,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:44,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:44,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:44,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:44,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:45,155 WARN L181 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-01-01 21:54:45,372 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-01 21:54:45,602 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-01-01 21:54:45,728 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-01-01 21:54:46,035 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-01 21:54:46,267 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:54:46,268 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:54:46,268 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:54:46,268 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:54:46,269 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:54:46,269 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:54:46,269 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:54:46,269 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:54:46,269 INFO L131 ssoRankerPreferences]: Filename of dumped script: ll_append-alloca_false-termination.c.i_Iteration1_Lasso [2019-01-01 21:54:46,270 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:54:46,271 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:54:46,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:46,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:47,050 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:54:47,055 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:54:47,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,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 [2019-01-01 21:54:47,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,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 [2019-01-01 21:54:47,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,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 [2019-01-01 21:54:47,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:47,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:47,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,226 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:47,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:47,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:47,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:47,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:47,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,340 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:54:47,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,341 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:54:47,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:47,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:47,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:47,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:47,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:47,357 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:54:47,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:47,362 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-01 21:54:47,362 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 21:54:47,449 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:54:47,510 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-01 21:54:47,510 INFO L444 ModelExtractionUtils]: 5 out of 11 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 21:54:47,513 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:54:47,517 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2019-01-01 21:54:47,517 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:54:47,518 INFO L520 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] [2019-01-01 21:54:47,550 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 21:54:47,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:47,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:47,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:47,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:54:47,852 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 [2019-01-01 21:54:47,854 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states. Second operand 5 states. [2019-01-01 21:54:48,051 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states.. Second operand 5 states. Result 45 states and 54 transitions. Complement of second has 13 states. [2019-01-01 21:54:48,052 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 [2019-01-01 21:54:48,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:54:48,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-01 21:54:48,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-01 21:54:48,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:48,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-01 21:54:48,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:48,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-01 21:54:48,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:48,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. [2019-01-01 21:54:48,064 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 21:54:48,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 29 states and 37 transitions. [2019-01-01 21:54:48,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-01-01 21:54:48,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-01 21:54:48,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2019-01-01 21:54:48,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:54:48,077 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2019-01-01 21:54:48,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2019-01-01 21:54:48,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-01-01 21:54:48,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-01 21:54:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-01-01 21:54:48,108 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-01-01 21:54:48,108 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-01-01 21:54:48,109 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:54:48,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2019-01-01 21:54:48,110 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 21:54:48,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:54:48,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:54:48,112 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:54:48,112 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:54:48,113 INFO L794 eck$LassoCheckResult]: Stem: 160#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 158#L-1 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; 159#L574 assume !(main_~n~0 < 1); 141#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 151#new_llENTRY ~n := #in~n; 163#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 140#new_llFINAL assume true; 142#new_llEXIT >#57#return; 153#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;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; 154#L563 assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; 157#L566-3 [2019-01-01 21:54:48,113 INFO L796 eck$LassoCheckResult]: Loop: 157#L566-3 call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); 155#L566-1 assume !!(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0);havoc append_#t~mem6.base, append_#t~mem6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8);append_~x.base, append_~x.offset := append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem7.base, append_#t~mem7.offset; 157#L566-3 [2019-01-01 21:54:48,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:48,113 INFO L82 PathProgramCache]: Analyzing trace with hash 772923198, now seen corresponding path program 1 times [2019-01-01 21:54:48,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:48,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:48,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:48,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:48,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:48,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:54:48,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:54:48,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 21:54:48,243 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:54:48,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:48,243 INFO L82 PathProgramCache]: Analyzing trace with hash 2086, now seen corresponding path program 1 times [2019-01-01 21:54:48,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:48,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:48,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:48,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:48,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:48,457 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-01 21:54:48,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:54:48,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:54:48,462 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-01-01 21:54:48,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:54:48,519 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-01-01 21:54:48,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:54:48,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2019-01-01 21:54:48,522 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 21:54:48,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 28 transitions. [2019-01-01 21:54:48,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-01-01 21:54:48,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-01-01 21:54:48,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2019-01-01 21:54:48,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:54:48,525 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-01-01 21:54:48,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2019-01-01 21:54:48,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-01 21:54:48,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-01 21:54:48,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-01-01 21:54:48,528 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-01-01 21:54:48,529 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-01-01 21:54:48,529 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:54:48,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2019-01-01 21:54:48,531 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 21:54:48,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:54:48,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:54:48,532 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:54:48,532 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:54:48,532 INFO L794 eck$LassoCheckResult]: Stem: 224#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 222#L-1 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; 223#L574 assume !(main_~n~0 < 1); 213#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 215#new_llENTRY ~n := #in~n; 225#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 205#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 216#new_llENTRY ~n := #in~n; 226#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 204#new_llFINAL assume true; 206#new_llEXIT >#53#return; 212#L552-1 call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 214#new_llFINAL assume true; 227#new_llEXIT >#57#return; 217#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;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; 218#L563 assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; 221#L566-3 [2019-01-01 21:54:48,532 INFO L796 eck$LassoCheckResult]: Loop: 221#L566-3 call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); 219#L566-1 assume !!(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0);havoc append_#t~mem6.base, append_#t~mem6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8);append_~x.base, append_~x.offset := append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem7.base, append_#t~mem7.offset; 221#L566-3 [2019-01-01 21:54:48,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:48,533 INFO L82 PathProgramCache]: Analyzing trace with hash 704779872, now seen corresponding path program 1 times [2019-01-01 21:54:48,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:48,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:48,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:48,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:48,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:48,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:48,571 INFO L82 PathProgramCache]: Analyzing trace with hash 2086, now seen corresponding path program 2 times [2019-01-01 21:54:48,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:48,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:48,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:48,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:48,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:48,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:48,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1311374651, now seen corresponding path program 1 times [2019-01-01 21:54:48,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:48,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:48,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:48,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:54:48,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:49,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:54:49,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:54:49,090 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 21:54:49,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:49,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:49,170 INFO L478 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 6 treesize of output 5 [2019-01-01 21:54:49,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:49,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:54:49,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-01-01 21:54:49,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-01 21:54:49,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:49,408 INFO L478 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 11 treesize of output 8 [2019-01-01 21:54:49,413 INFO L478 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 8 treesize of output 7 [2019-01-01 21:54:49,414 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:49,416 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:54:49,505 INFO L478 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 11 treesize of output 8 [2019-01-01 21:54:49,512 INFO L478 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 8 treesize of output 7 [2019-01-01 21:54:49,513 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:49,515 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:54:49,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:54:49,522 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-01-01 21:54:49,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-01 21:54:49,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-01 21:54:49,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:49,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:54:49,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-01 21:54:49,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-01 21:54:49,826 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:54:49,829 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:54:49,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:54:49,850 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-01-01 21:54:50,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:54:50,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:54:50,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2019-01-01 21:54:50,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 21:54:50,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-01-01 21:54:50,141 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. cyclomatic complexity: 7 Second operand 14 states. [2019-01-01 21:54:50,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:54:50,504 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-01-01 21:54:50,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 21:54:50,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2019-01-01 21:54:50,509 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 21:54:50,510 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 40 transitions. [2019-01-01 21:54:50,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2019-01-01 21:54:50,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-01-01 21:54:50,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 40 transitions. [2019-01-01 21:54:50,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:54:50,511 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-01-01 21:54:50,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 40 transitions. [2019-01-01 21:54:50,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-01-01 21:54:50,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-01 21:54:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-01-01 21:54:50,518 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-01-01 21:54:50,518 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-01-01 21:54:50,518 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:54:50,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2019-01-01 21:54:50,520 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 21:54:50,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:54:50,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:54:50,522 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:54:50,523 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:54:50,523 INFO L794 eck$LassoCheckResult]: Stem: 356#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 352#L-1 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; 353#L574 assume !(main_~n~0 < 1); 342#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 346#new_llENTRY ~n := #in~n; 358#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 341#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 347#new_llENTRY ~n := #in~n; 359#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 360#new_llFINAL assume true; 357#new_llEXIT >#53#return; 345#L552-1 call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 340#new_llFINAL assume true; 343#new_llEXIT >#57#return; 363#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;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; 362#L563 assume append_~x.base == 0 && append_~x.offset == 0;append_#res.base, append_#res.offset := append_~y.base, append_~y.offset; 344#L569 main_#t~ret10.base, main_#t~ret10.offset := append_#res.base, append_#res.offset;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; 338#L579 call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset);< 336#lengthENTRY [2019-01-01 21:54:50,523 INFO L796 eck$LassoCheckResult]: Loop: 336#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 339#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); 337#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 336#lengthENTRY [2019-01-01 21:54:50,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:50,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1311376214, now seen corresponding path program 1 times [2019-01-01 21:54:50,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:50,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:50,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:50,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:50,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:50,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:54:50,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:54:50,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 21:54:50,681 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:54:50,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:50,681 INFO L82 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 1 times [2019-01-01 21:54:50,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:50,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:50,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:50,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:50,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:50,915 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-01 21:54:50,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 21:54:50,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:54:50,916 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 9 Second operand 6 states. [2019-01-01 21:54:50,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:54:50,962 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2019-01-01 21:54:50,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 21:54:50,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 41 transitions. [2019-01-01 21:54:50,966 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 21:54:50,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 41 transitions. [2019-01-01 21:54:50,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-01-01 21:54:50,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-01-01 21:54:50,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 41 transitions. [2019-01-01 21:54:50,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:54:50,970 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-01-01 21:54:50,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 41 transitions. [2019-01-01 21:54:50,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2019-01-01 21:54:50,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-01 21:54:50,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-01-01 21:54:50,976 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-01-01 21:54:50,976 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-01-01 21:54:50,976 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:54:50,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2019-01-01 21:54:50,977 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 21:54:50,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:54:50,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:54:50,981 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] [2019-01-01 21:54:50,981 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:54:50,981 INFO L794 eck$LassoCheckResult]: Stem: 436#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 431#L-1 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; 432#L574 assume !(main_~n~0 < 1); 417#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 425#new_llENTRY ~n := #in~n; 439#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 416#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 426#new_llENTRY ~n := #in~n; 440#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 441#new_llFINAL assume true; 437#new_llEXIT >#53#return; 438#L552-1 call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 445#new_llFINAL assume true; 442#new_llEXIT >#57#return; 427#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;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; 428#L563 assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; 443#L566-3 call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); 429#L566-1 assume !(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0);havoc append_#t~mem6.base, append_#t~mem6.offset; 430#L566-4 call write~$Pointer$(append_~y.base, append_~y.offset, append_~x.base, 4 + append_~x.offset, 8);append_#res.base, append_#res.offset := append_~s~0.base, append_~s~0.offset; 423#L569 main_#t~ret10.base, main_#t~ret10.offset := append_#res.base, append_#res.offset;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; 421#L579 call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset);< 419#lengthENTRY [2019-01-01 21:54:50,981 INFO L796 eck$LassoCheckResult]: Loop: 419#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 422#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); 420#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 419#lengthENTRY [2019-01-01 21:54:50,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:50,982 INFO L82 PathProgramCache]: Analyzing trace with hash -139719339, now seen corresponding path program 1 times [2019-01-01 21:54:50,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:50,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:50,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:50,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:50,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:51,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:51,046 INFO L82 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 2 times [2019-01-01 21:54:51,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:51,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:51,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:51,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:51,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:51,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:51,061 INFO L82 PathProgramCache]: Analyzing trace with hash -555510211, now seen corresponding path program 1 times [2019-01-01 21:54:51,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:51,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:51,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:51,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:54:51,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:51,308 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-01 21:54:51,959 WARN L181 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 111 [2019-01-01 21:54:51,966 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:51,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:52,053 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:52,058 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:52,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:52,115 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:131, output treesize:107 [2019-01-01 21:54:52,324 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-01 21:54:53,179 WARN L181 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 148 [2019-01-01 21:54:53,190 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:53,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:53,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:53,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:217, output treesize:221 [2019-01-01 21:54:53,536 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-01-01 21:54:53,697 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-01-01 21:54:53,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:54:53 BoogieIcfgContainer [2019-01-01 21:54:53,828 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:54:53,828 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:54:53,829 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:54:53,829 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:54:53,830 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:54:44" (3/4) ... [2019-01-01 21:54:53,841 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 21:54:53,978 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 21:54:53,979 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:54:53,980 INFO L168 Benchmark]: Toolchain (without parser) took 11082.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.7 MB). Free memory was 948.7 MB in the beginning and 806.7 MB in the end (delta: 142.0 MB). Peak memory consumption was 351.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:54:53,985 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:54:53,986 INFO L168 Benchmark]: CACSL2BoogieTranslator took 598.15 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 921.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:54:53,987 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 921.8 MB in the beginning and 1.1 GB in the end (delta: -199.1 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:54:53,993 INFO L168 Benchmark]: Boogie Preprocessor took 33.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:54:53,994 INFO L168 Benchmark]: RCFGBuilder took 575.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:54:53,995 INFO L168 Benchmark]: BuchiAutomizer took 9590.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.1 GB in the beginning and 806.7 MB in the end (delta: 289.8 MB). Peak memory consumption was 366.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:54:53,996 INFO L168 Benchmark]: Witness Printer took 150.50 ms. Allocated memory is still 1.2 GB. Free memory is still 806.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:54:54,012 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 598.15 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 921.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 127.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 921.8 MB in the beginning and 1.1 GB in the end (delta: -199.1 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 575.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9590.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.1 GB in the beginning and 806.7 MB in the end (delta: 289.8 MB). Peak memory consumption was 366.9 MB. Max. memory is 11.5 GB. * Witness Printer took 150.50 ms. Allocated memory is still 1.2 GB. Free memory is still 806.7 MB. There was no memory consumed. 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 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(n) and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 14 locations. The remainder module has 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.4s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 8.3s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 64 SDtfs, 43 SDslu, 218 SDs, 0 SdLazy, 193 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital133 mio100 ax100 hnf100 lsp95 ukn25 mio100 lsp42 div100 bol100 ite100 ukn100 eq214 hnf86 smp100 dnf130 smp100 tf100 neg94 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 162ms 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 {NULL=-2} 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@41c9b0c8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2d065a52=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3c205bef=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3c205bef=0, s=0, NULL=-2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@202d8f88=0, xs=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@54439a3e=0, NULL=0, y=0, y=0, \result=0, x=0, y=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@fa58eca=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6945251b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6945251b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2d065a52=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7bc76f9c=0, x=0, y=0, n=0, NULL=0, y=0, xs=-1, \result=0, \result=0, NULL=0, xs=0, xs=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@202d8f88=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@41c9b0c8=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] node_t* head = malloc(sizeof(node_t)); [L551] head->val = n [L552] CALL, EXPR new_ll(n-1) [L548] COND TRUE n == 0 [L549] return ((void *)0); [L552] RET, EXPR new_ll(n-1) [L552] head->next = new_ll(n-1) [L553] return head; [L577] RET, EXPR new_ll(n) [L577] node_t* x = new_ll(n); [L563] COND FALSE !(x == ((void *)0)) [L565] node_t* s = x; [L566] EXPR x->next [L566] COND FALSE !(x->next != ((void *)0)) [L568] x->next = y [L569] return s; [L578] node_t* y = append(x, x); [L579] CALL length(y) Loop: [L557] COND FALSE !(xs == ((void *)0)) [L559] EXPR xs->next [L559] CALL length(xs->next) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...