./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.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-30f4e4a [2019-11-28 03:02:42,616 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:02:42,618 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:02:42,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:02:42,632 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:02:42,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:02:42,634 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:02:42,637 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:02:42,639 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:02:42,640 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:02:42,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:02:42,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:02:42,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:02:42,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:02:42,645 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:02:42,646 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:02:42,647 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:02:42,648 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:02:42,650 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:02:42,652 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:02:42,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:02:42,655 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:02:42,656 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:02:42,657 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:02:42,660 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:02:42,660 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:02:42,660 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:02:42,661 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:02:42,662 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:02:42,663 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:02:42,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:02:42,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:02:42,665 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:02:42,666 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:02:42,667 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:02:42,667 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:02:42,668 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:02:42,668 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:02:42,669 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:02:42,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:02:42,670 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:02:42,671 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 03:02:42,689 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:02:42,689 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:02:42,691 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:02:42,691 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:02:42,691 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:02:42,692 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:02:42,692 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:02:42,692 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:02:42,692 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:02:42,692 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:02:42,693 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:02:42,693 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:02:42,694 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:02:42,694 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:02:42,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:02:42,694 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:02:42,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:02:42,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:02:42,695 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:02:42,695 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:02:42,696 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:02:42,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:02:42,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:02:42,696 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:02:42,697 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:02:42,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:02:42,698 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:02:42,699 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:02:42,701 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:02:42,701 INFO L138 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-11-28 03:02:43,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:02:43,033 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:02:43,036 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:02:43,037 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:02:43,038 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:02:43,038 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i [2019-11-28 03:02:43,100 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7035e2e79/1ea4e68d3e244cd09b22e7fea0d5bf1e/FLAG6399d0b97 [2019-11-28 03:02:43,603 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:02:43,603 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i [2019-11-28 03:02:43,615 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7035e2e79/1ea4e68d3e244cd09b22e7fea0d5bf1e/FLAG6399d0b97 [2019-11-28 03:02:43,903 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7035e2e79/1ea4e68d3e244cd09b22e7fea0d5bf1e [2019-11-28 03:02:43,907 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:02:43,909 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:02:43,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:02:43,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:02:43,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:02:43,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:02:43" (1/1) ... [2019-11-28 03:02:43,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@588ffba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:43, skipping insertion in model container [2019-11-28 03:02:43,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:02:43" (1/1) ... [2019-11-28 03:02:43,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:02:43,965 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:02:44,407 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:02:44,420 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:02:44,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:02:44,516 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:02:44,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:44 WrapperNode [2019-11-28 03:02:44,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:02:44,517 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:02:44,518 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:02:44,518 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:02:44,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:44" (1/1) ... [2019-11-28 03:02:44,550 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:44" (1/1) ... [2019-11-28 03:02:44,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:02:44,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:02:44,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:02:44,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:02:44,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:44" (1/1) ... [2019-11-28 03:02:44,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:44" (1/1) ... [2019-11-28 03:02:44,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:44" (1/1) ... [2019-11-28 03:02:44,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:44" (1/1) ... [2019-11-28 03:02:44,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:44" (1/1) ... [2019-11-28 03:02:44,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:44" (1/1) ... [2019-11-28 03:02:44,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:44" (1/1) ... [2019-11-28 03:02:44,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:02:44,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:02:44,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:02:44,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:02:44,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:44" (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-11-28 03:02:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure new_ll [2019-11-28 03:02:44,674 INFO L138 BoogieDeclarations]: Found implementation of procedure new_ll [2019-11-28 03:02:44,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:02:44,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 03:02:44,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 03:02:44,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 03:02:44,675 INFO L130 BoogieDeclarations]: Found specification of procedure length [2019-11-28 03:02:44,675 INFO L138 BoogieDeclarations]: Found implementation of procedure length [2019-11-28 03:02:44,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:02:44,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:02:44,998 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:02:44,998 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 03:02:44,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:02:44 BoogieIcfgContainer [2019-11-28 03:02:45,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:02:45,000 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:02:45,001 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:02:45,004 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:02:45,005 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:02:45,005 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:02:43" (1/3) ... [2019-11-28 03:02:45,007 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@225957a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:02:45, skipping insertion in model container [2019-11-28 03:02:45,007 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:02:45,007 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:44" (2/3) ... [2019-11-28 03:02:45,008 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@225957a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:02:45, skipping insertion in model container [2019-11-28 03:02:45,008 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:02:45,008 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:02:44" (3/3) ... [2019-11-28 03:02:45,010 INFO L371 chiAutomizerObserver]: Analyzing ICFG ll_append-alloca-2.i [2019-11-28 03:02:45,056 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:02:45,056 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:02:45,056 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:02:45,057 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:02:45,057 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:02:45,057 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:02:45,057 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:02:45,058 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:02:45,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-11-28 03:02:45,096 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-28 03:02:45,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:02:45,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:02:45,104 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 03:02:45,104 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:02:45,104 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:02:45,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-11-28 03:02:45,108 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-28 03:02:45,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:02:45,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:02:45,109 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 03:02:45,109 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:02:45,115 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-11-28 03:02:45,115 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-11-28 03:02:45,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:45,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1418244, now seen corresponding path program 1 times [2019-11-28 03:02:45,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:45,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280612264] [2019-11-28 03:02:45,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:45,255 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:02:45,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:45,257 INFO L82 PathProgramCache]: Analyzing trace with hash 29967, now seen corresponding path program 1 times [2019-11-28 03:02:45,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:45,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374678357] [2019-11-28 03:02:45,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:45,304 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:02:45,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:45,306 INFO L82 PathProgramCache]: Analyzing trace with hash -698765780, now seen corresponding path program 1 times [2019-11-28 03:02:45,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:45,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530548406] [2019-11-28 03:02:45,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:45,352 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:02:45,571 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-11-28 03:02:45,795 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-28 03:02:46,104 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:02:46,105 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:02:46,105 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:02:46,105 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:02:46,105 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:02:46,105 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:46,106 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:02:46,106 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:02:46,106 INFO L133 ssoRankerPreferences]: Filename of dumped script: ll_append-alloca-2.i_Iteration1_Lasso [2019-11-28 03:02:46,106 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:02:46,107 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:02:46,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:46,580 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:02:46,586 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:46,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-28 03:02:46,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:46,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:46,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:46,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:46,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:46,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:46,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:46,607 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:46,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-28 03:02:46,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:46,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:46,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:46,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:46,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:46,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:46,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:46,627 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:46,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:46,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:46,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:46,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:46,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:46,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:46,647 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:46,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:02:46,655 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:46,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-28 03:02:46,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:46,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:46,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:46,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:46,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:46,672 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:46,672 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:02:46,676 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:46,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-28 03:02:46,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:46,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:46,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:46,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:46,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:46,690 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:46,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:02:46,692 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:46,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-28 03:02:46,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:46,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:46,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:46,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:46,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:46,718 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:46,718 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:46,721 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:46,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-28 03:02:46,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:46,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:46,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:46,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:46,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:46,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:46,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:02:46,737 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:46,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-28 03:02:46,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:46,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:46,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:46,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:46,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:46,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:46,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:02:46,761 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:46,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-28 03:02:46,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:46,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:46,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:46,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:46,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:46,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:46,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:46,786 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:46,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-28 03:02:46,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:46,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:46,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:46,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:46,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:46,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:46,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:46,806 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:46,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-28 03:02:46,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:46,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:46,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:46,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:46,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:46,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:46,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:46,828 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:46,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-28 03:02:46,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:46,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:46,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:46,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:46,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:46,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:46,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:46,847 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:46,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-28 03:02:46,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:46,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:46,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:46,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:46,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:46,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:46,868 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:02:46,869 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:46,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-28 03:02:46,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:46,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:46,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:46,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:46,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:46,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:46,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:46,895 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:46,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-28 03:02:46,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:46,915 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:46,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:46,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:46,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:46,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:46,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:02:46,929 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:46,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:46,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:46,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:46,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:46,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:46,946 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:02:46,946 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:02:46,952 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:46,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-28 03:02:46,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:46,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:46,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:46,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:46,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:46,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:46,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:02:46,973 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:46,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-28 03:02:46,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:46,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:46,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:46,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:46,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:46,985 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:46,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:02:46,990 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:46,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-28 03:02:47,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:47,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:47,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:47,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:47,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:47,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:47,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:02:47,005 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:47,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-28 03:02:47,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:47,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:47,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:47,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:47,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:47,038 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:47,038 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:02:47,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:47,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-28 03:02:47,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:47,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:47,053 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:02:47,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:47,062 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-28 03:02:47,062 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-28 03:02:47,079 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:02:47,111 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-28 03:02:47,111 INFO L444 ModelExtractionUtils]: 2 out of 11 variables were initially zero. Simplification set additionally 6 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:47,167 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:47,176 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2019-11-28 03:02:47,176 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:02:47,177 INFO L512 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-11-28 03:02:47,187 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-11-28 03:02:47,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:47,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:02:47,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:02:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:47,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:02:47,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:02:47,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:02:47,356 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-11-28 03:02:47,357 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states. Second operand 5 states. [2019-11-28 03:02:47,525 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-11-28 03:02:47,526 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-11-28 03:02:47,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:02:47,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-28 03:02:47,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2019-11-28 03:02:47,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:02:47,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-28 03:02:47,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:02:47,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-28 03:02:47,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:02:47,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. [2019-11-28 03:02:47,546 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-28 03:02:47,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 29 states and 37 transitions. [2019-11-28 03:02:47,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-28 03:02:47,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-28 03:02:47,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2019-11-28 03:02:47,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:02:47,562 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2019-11-28 03:02:47,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2019-11-28 03:02:47,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-11-28 03:02:47,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 03:02:47,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-11-28 03:02:47,602 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-11-28 03:02:47,602 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-11-28 03:02:47,602 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:02:47,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2019-11-28 03:02:47,606 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-28 03:02:47,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:02:47,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:02:47,607 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:02:47,608 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:02:47,608 INFO L794 eck$LassoCheckResult]: Stem: 160#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-11-28 03:02:47,609 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-11-28 03:02:47,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:47,609 INFO L82 PathProgramCache]: Analyzing trace with hash 772923198, now seen corresponding path program 1 times [2019-11-28 03:02:47,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:47,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900330936] [2019-11-28 03:02:47,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:47,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:47,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:02:47,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900330936] [2019-11-28 03:02:47,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:02:47,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 03:02:47,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043799221] [2019-11-28 03:02:47,789 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:02:47,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:47,791 INFO L82 PathProgramCache]: Analyzing trace with hash 2086, now seen corresponding path program 1 times [2019-11-28 03:02:47,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:47,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854070725] [2019-11-28 03:02:47,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:47,819 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:02:47,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:02:47,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 03:02:47,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 03:02:47,890 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 6 states. [2019-11-28 03:02:47,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:02:47,996 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-11-28 03:02:47,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:02:47,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2019-11-28 03:02:47,998 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-28 03:02:47,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 28 transitions. [2019-11-28 03:02:48,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-28 03:02:48,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-28 03:02:48,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2019-11-28 03:02:48,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:02:48,000 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-11-28 03:02:48,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2019-11-28 03:02:48,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-28 03:02:48,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 03:02:48,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-11-28 03:02:48,004 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-11-28 03:02:48,004 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-11-28 03:02:48,005 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:02:48,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2019-11-28 03:02:48,006 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-28 03:02:48,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:02:48,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:02:48,007 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:02:48,007 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:02:48,007 INFO L794 eck$LassoCheckResult]: Stem: 231#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 229#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; 230#L574 assume !(main_~n~0 < 1); 220#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 222#new_llENTRY ~n := #in~n; 232#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); 212#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 223#new_llENTRY ~n := #in~n; 233#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 211#new_llFINAL assume true; 213#new_llEXIT >#53#return; 219#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; 221#new_llFINAL assume true; 234#new_llEXIT >#57#return; 224#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; 225#L563 assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; 228#L566-3 [2019-11-28 03:02:48,008 INFO L796 eck$LassoCheckResult]: Loop: 228#L566-3 call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); 226#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; 228#L566-3 [2019-11-28 03:02:48,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:48,008 INFO L82 PathProgramCache]: Analyzing trace with hash 704779872, now seen corresponding path program 1 times [2019-11-28 03:02:48,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:48,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208593563] [2019-11-28 03:02:48,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:48,050 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:02:48,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:48,051 INFO L82 PathProgramCache]: Analyzing trace with hash 2086, now seen corresponding path program 2 times [2019-11-28 03:02:48,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:48,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779772838] [2019-11-28 03:02:48,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:48,059 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:02:48,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:48,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1311374651, now seen corresponding path program 1 times [2019-11-28 03:02:48,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:48,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237072380] [2019-11-28 03:02:48,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:48,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 03:02:48,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237072380] [2019-11-28 03:02:48,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795210590] [2019-11-28 03:02:48,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:02:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:48,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-28 03:02:48,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:02:48,434 INFO L377 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-11-28 03:02:48,434 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:02:48,447 INFO L588 ElimStorePlain]: treesize reduction 3, result has 75.0 percent of original size [2019-11-28 03:02:48,448 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:02:48,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-28 03:02:48,551 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 03:02:48,552 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:02:48,561 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:02:48,567 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-28 03:02:48,568 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 03:02:48,576 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:02:48,580 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-28 03:02:48,580 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 03:02:48,588 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:02:48,588 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:02:48,588 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-11-28 03:02:48,605 INFO L377 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 7 [2019-11-28 03:02:48,606 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:02:48,612 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:02:48,616 INFO L377 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 7 [2019-11-28 03:02:48,616 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 03:02:48,621 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:02:48,621 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:02:48,622 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-11-28 03:02:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:02:48,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:02:48,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-11-28 03:02:48,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745514900] [2019-11-28 03:02:48,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:02:48,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 03:02:48,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-11-28 03:02:48,701 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. cyclomatic complexity: 7 Second operand 15 states. [2019-11-28 03:02:48,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:02:48,930 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-11-28 03:02:48,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 03:02:48,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2019-11-28 03:02:48,932 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-28 03:02:48,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 40 transitions. [2019-11-28 03:02:48,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2019-11-28 03:02:48,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-11-28 03:02:48,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 40 transitions. [2019-11-28 03:02:48,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:02:48,935 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-11-28 03:02:48,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 40 transitions. [2019-11-28 03:02:48,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-11-28 03:02:48,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 03:02:48,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-11-28 03:02:48,939 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-11-28 03:02:48,939 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-11-28 03:02:48,939 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:02:48,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2019-11-28 03:02:48,940 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-28 03:02:48,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:02:48,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:02:48,941 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:02:48,941 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:02:48,941 INFO L794 eck$LassoCheckResult]: Stem: 378#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 376#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; 377#L574 assume !(main_~n~0 < 1); 362#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 370#new_llENTRY ~n := #in~n; 382#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); 361#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 371#new_llENTRY ~n := #in~n; 383#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 384#new_llFINAL assume true; 381#new_llEXIT >#53#return; 369#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; 360#new_llFINAL assume true; 363#new_llEXIT >#57#return; 387#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; 386#L563 assume append_~x.base == 0 && append_~x.offset == 0;append_#res.base, append_#res.offset := append_~y.base, append_~y.offset; 368#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; 365#L579 call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset);< 364#lengthENTRY [2019-11-28 03:02:48,942 INFO L796 eck$LassoCheckResult]: Loop: 364#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 367#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); 366#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 364#lengthENTRY [2019-11-28 03:02:48,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:48,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1311376214, now seen corresponding path program 1 times [2019-11-28 03:02:48,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:48,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782440567] [2019-11-28 03:02:48,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:49,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 03:02:49,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782440567] [2019-11-28 03:02:49,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:02:49,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 03:02:49,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483589703] [2019-11-28 03:02:49,072 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:02:49,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:49,073 INFO L82 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 1 times [2019-11-28 03:02:49,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:49,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383247647] [2019-11-28 03:02:49,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:49,093 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:02:49,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:02:49,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 03:02:49,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 03:02:49,217 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 9 Second operand 7 states. [2019-11-28 03:02:49,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:02:49,305 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2019-11-28 03:02:49,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:02:49,307 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 41 transitions. [2019-11-28 03:02:49,309 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-28 03:02:49,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 41 transitions. [2019-11-28 03:02:49,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-28 03:02:49,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-11-28 03:02:49,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 41 transitions. [2019-11-28 03:02:49,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:02:49,312 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-11-28 03:02:49,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 41 transitions. [2019-11-28 03:02:49,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2019-11-28 03:02:49,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 03:02:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-11-28 03:02:49,316 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-11-28 03:02:49,316 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-11-28 03:02:49,317 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:02:49,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2019-11-28 03:02:49,318 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-28 03:02:49,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:02:49,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:02:49,319 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:02:49,319 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:02:49,319 INFO L794 eck$LassoCheckResult]: Stem: 474#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 470#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; 471#L574 assume !(main_~n~0 < 1); 456#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 464#new_llENTRY ~n := #in~n; 478#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); 455#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 465#new_llENTRY ~n := #in~n; 479#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 480#new_llFINAL assume true; 476#new_llEXIT >#53#return; 477#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; 484#new_llFINAL assume true; 481#new_llEXIT >#57#return; 466#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; 467#L563 assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; 482#L566-3 call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); 468#L566-1 assume !(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0);havoc append_#t~mem6.base, append_#t~mem6.offset; 469#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; 462#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; 459#L579 call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset);< 458#lengthENTRY [2019-11-28 03:02:49,319 INFO L796 eck$LassoCheckResult]: Loop: 458#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 461#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); 460#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 458#lengthENTRY [2019-11-28 03:02:49,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:49,320 INFO L82 PathProgramCache]: Analyzing trace with hash -139719339, now seen corresponding path program 1 times [2019-11-28 03:02:49,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:49,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268639859] [2019-11-28 03:02:49,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:49,377 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:02:49,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:49,378 INFO L82 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 2 times [2019-11-28 03:02:49,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:49,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85930257] [2019-11-28 03:02:49,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:49,386 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:02:49,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:49,386 INFO L82 PathProgramCache]: Analyzing trace with hash -555510211, now seen corresponding path program 1 times [2019-11-28 03:02:49,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:49,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645635392] [2019-11-28 03:02:49,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:49,436 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:02:50,078 WARN L192 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 111 [2019-11-28 03:02:50,103 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 03:02:50,175 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:02:50,186 INFO L508 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 03:02:50,243 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:02:50,244 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 03:02:50,244 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:131, output treesize:107 [2019-11-28 03:02:50,482 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-28 03:02:51,299 WARN L192 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 149 [2019-11-28 03:02:51,318 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 03:02:51,449 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-28 03:02:51,450 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:02:51,451 INFO L508 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-11-28 03:02:51,452 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:220, output treesize:224 [2019-11-28 03:02:51,609 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-28 03:02:51,781 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-28 03:02:51,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:02:51 BoogieIcfgContainer [2019-11-28 03:02:51,871 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:02:51,872 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:02:51,873 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:02:51,873 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:02:51,873 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:02:44" (3/4) ... [2019-11-28 03:02:51,877 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 03:02:51,953 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 03:02:51,953 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:02:51,955 INFO L168 Benchmark]: Toolchain (without parser) took 8046.70 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 295.7 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -152.5 MB). Peak memory consumption was 143.2 MB. Max. memory is 11.5 GB. [2019-11-28 03:02:51,955 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:02:51,956 INFO L168 Benchmark]: CACSL2BoogieTranslator took 607.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-28 03:02:51,961 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.02 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:02:51,962 INFO L168 Benchmark]: Boogie Preprocessor took 38.48 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-11-28 03:02:51,963 INFO L168 Benchmark]: RCFGBuilder took 389.47 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: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-28 03:02:51,965 INFO L168 Benchmark]: BuchiAutomizer took 6870.76 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -5.7 MB). Peak memory consumption was 339.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:02:51,967 INFO L168 Benchmark]: Witness Printer took 80.96 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:02:51,970 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 607.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.02 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.48 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 389.47 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: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6870.76 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -5.7 MB). Peak memory consumption was 339.4 MB. Max. memory is 11.5 GB. * Witness Printer took 80.96 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. 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 15 locations. The remainder module has 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.7s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 5.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. 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: 61 SDtfs, 58 SDslu, 209 SDs, 0 SdLazy, 237 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital136 mio100 ax100 hnf100 lsp95 ukn27 mio100 lsp38 div100 bol100 ite100 ukn100 eq214 hnf86 smp100 dnf130 smp100 tf100 neg94 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 128ms 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=1} 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@15c8ac4f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6045ea1e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@54862c79=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@54862c79=0, s=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a6d386a=0, xs=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7e9ab264=0, NULL=0, y=0, y=0, \result=0, x=0, y=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2fca5b25=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@c25a062=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@c25a062=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6045ea1e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1288a13c=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@3a6d386a=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@15c8ac4f=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...