./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 906a4fb5 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.25-906a4fb [2020-10-19 18:48:25,410 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 18:48:25,414 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 18:48:25,453 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 18:48:25,453 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 18:48:25,462 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 18:48:25,465 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 18:48:25,470 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 18:48:25,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 18:48:25,475 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 18:48:25,476 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 18:48:25,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 18:48:25,477 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 18:48:25,479 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 18:48:25,480 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 18:48:25,481 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 18:48:25,482 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 18:48:25,483 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 18:48:25,484 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 18:48:25,486 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 18:48:25,487 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 18:48:25,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 18:48:25,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 18:48:25,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 18:48:25,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 18:48:25,494 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 18:48:25,494 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 18:48:25,495 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 18:48:25,495 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 18:48:25,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 18:48:25,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 18:48:25,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 18:48:25,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 18:48:25,499 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 18:48:25,500 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 18:48:25,500 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 18:48:25,501 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 18:48:25,501 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 18:48:25,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 18:48:25,502 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 18:48:25,503 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 18:48:25,504 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-19 18:48:25,530 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 18:48:25,530 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 18:48:25,532 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 18:48:25,532 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 18:48:25,532 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 18:48:25,533 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 18:48:25,533 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 18:48:25,533 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 18:48:25,533 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 18:48:25,534 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 18:48:25,534 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 18:48:25,534 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 18:48:25,534 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 18:48:25,535 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 18:48:25,535 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 18:48:25,535 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 18:48:25,535 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 18:48:25,536 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 18:48:25,536 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 18:48:25,536 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 18:48:25,537 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 18:48:25,537 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 18:48:25,537 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 18:48:25,537 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 18:48:25,538 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 18:48:25,538 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 18:48:25,538 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 18:48:25,539 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 18:48:25,539 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 18:48:25,540 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 18:48:25,540 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 [2020-10-19 18:48:25,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 18:48:25,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 18:48:25,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 18:48:25,865 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 18:48:25,866 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 18:48:25,866 INFO L432 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 [2020-10-19 18:48:25,941 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20bebf0d5/8d0f8e56b48e465c81c90ad1f0346022/FLAGeef067ae3 [2020-10-19 18:48:26,459 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 18:48:26,460 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i [2020-10-19 18:48:26,474 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20bebf0d5/8d0f8e56b48e465c81c90ad1f0346022/FLAGeef067ae3 [2020-10-19 18:48:26,754 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20bebf0d5/8d0f8e56b48e465c81c90ad1f0346022 [2020-10-19 18:48:26,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 18:48:26,763 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 18:48:26,764 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 18:48:26,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 18:48:26,768 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 18:48:26,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:48:26" (1/1) ... [2020-10-19 18:48:26,772 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54212748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:48:26, skipping insertion in model container [2020-10-19 18:48:26,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:48:26" (1/1) ... [2020-10-19 18:48:26,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 18:48:26,836 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 18:48:27,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:48:27,177 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 18:48:27,292 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:48:27,361 INFO L208 MainTranslator]: Completed translation [2020-10-19 18:48:27,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:48:27 WrapperNode [2020-10-19 18:48:27,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 18:48:27,363 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 18:48:27,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 18:48:27,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 18:48:27,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:48:27" (1/1) ... [2020-10-19 18:48:27,387 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:48:27" (1/1) ... [2020-10-19 18:48:27,410 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 18:48:27,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 18:48:27,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 18:48:27,411 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 18:48:27,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:48:27" (1/1) ... [2020-10-19 18:48:27,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:48:27" (1/1) ... [2020-10-19 18:48:27,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:48:27" (1/1) ... [2020-10-19 18:48:27,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:48:27" (1/1) ... [2020-10-19 18:48:27,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:48:27" (1/1) ... [2020-10-19 18:48:27,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:48:27" (1/1) ... [2020-10-19 18:48:27,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:48:27" (1/1) ... [2020-10-19 18:48:27,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 18:48:27,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 18:48:27,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 18:48:27,443 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 18:48:27,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:48:27" (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 [2020-10-19 18:48:27,527 INFO L130 BoogieDeclarations]: Found specification of procedure new_ll [2020-10-19 18:48:27,528 INFO L138 BoogieDeclarations]: Found implementation of procedure new_ll [2020-10-19 18:48:27,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 18:48:27,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-19 18:48:27,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-19 18:48:27,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-19 18:48:27,528 INFO L130 BoogieDeclarations]: Found specification of procedure length [2020-10-19 18:48:27,528 INFO L138 BoogieDeclarations]: Found implementation of procedure length [2020-10-19 18:48:27,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 18:48:27,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 18:48:27,883 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 18:48:27,884 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-19 18:48:27,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:48:27 BoogieIcfgContainer [2020-10-19 18:48:27,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 18:48:27,886 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 18:48:27,887 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 18:48:27,890 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 18:48:27,891 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:48:27,891 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 06:48:26" (1/3) ... [2020-10-19 18:48:27,892 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@227ce640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:48:27, skipping insertion in model container [2020-10-19 18:48:27,893 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:48:27,893 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:48:27" (2/3) ... [2020-10-19 18:48:27,893 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@227ce640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:48:27, skipping insertion in model container [2020-10-19 18:48:27,894 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:48:27,894 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:48:27" (3/3) ... [2020-10-19 18:48:27,896 INFO L373 chiAutomizerObserver]: Analyzing ICFG ll_append-alloca-2.i [2020-10-19 18:48:27,938 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 18:48:27,938 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 18:48:27,939 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 18:48:27,939 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 18:48:27,939 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 18:48:27,939 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 18:48:27,939 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 18:48:27,939 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 18:48:27,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2020-10-19 18:48:27,982 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-10-19 18:48:27,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:48:27,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:48:27,989 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 18:48:27,989 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:48:27,990 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 18:48:27,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2020-10-19 18:48:27,993 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-10-19 18:48:27,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:48:27,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:48:27,994 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 18:48:27,994 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:48:28,000 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 [2020-10-19 18:48:28,000 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 [2020-10-19 18:48:28,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:28,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1418244, now seen corresponding path program 1 times [2020-10-19 18:48:28,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:28,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045339967] [2020-10-19 18:48:28,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:28,107 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:28,116 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:28,138 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:48:28,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:28,139 INFO L82 PathProgramCache]: Analyzing trace with hash 29967, now seen corresponding path program 1 times [2020-10-19 18:48:28,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:28,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953558895] [2020-10-19 18:48:28,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:28,166 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:28,184 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:28,188 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:48:28,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:28,190 INFO L82 PathProgramCache]: Analyzing trace with hash -698765780, now seen corresponding path program 1 times [2020-10-19 18:48:28,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:28,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407959936] [2020-10-19 18:48:28,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:28,230 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:28,268 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:28,274 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:48:28,461 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2020-10-19 18:48:28,962 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:48:28,963 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:48:28,963 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:48:28,963 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:48:28,963 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:48:28,963 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:28,964 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:48:28,964 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:48:28,964 INFO L133 ssoRankerPreferences]: Filename of dumped script: ll_append-alloca-2.i_Iteration1_Lasso [2020-10-19 18:48:28,964 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:48:28,965 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:48:28,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:28,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:28,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:48:29,403 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:48:29,408 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) [2020-10-19 18:48:29,414 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 [2020-10-19 18:48:29,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:29,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:48:29,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:29,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:29,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:29,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:48:29,420 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 [2020-10-19 18:48:29,429 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) [2020-10-19 18:48:29,472 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 [2020-10-19 18:48:29,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:29,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:48:29,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:29,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:29,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:29,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:48:29,475 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 [2020-10-19 18:48:29,477 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) [2020-10-19 18:48:29,523 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 [2020-10-19 18:48:29,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:29,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:48:29,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:29,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:29,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:29,527 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:48:29,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:29,529 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) [2020-10-19 18:48:29,575 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 [2020-10-19 18:48:29,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:29,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:48:29,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:29,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:29,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:29,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:48:29,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:29,582 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 [2020-10-19 18:48:29,622 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 [2020-10-19 18:48:29,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:29,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:48:29,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:29,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:29,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:29,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:48:29,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:48:29,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 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:29,654 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 [2020-10-19 18:48:29,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:29,656 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:48:29,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:29,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:29,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:29,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:48:29,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:48:29,659 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 [2020-10-19 18:48:29,690 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 [2020-10-19 18:48:29,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:29,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:48:29,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:29,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:29,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:29,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:48:29,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:48:29,695 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) [2020-10-19 18:48:29,726 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 [2020-10-19 18:48:29,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:29,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:29,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:29,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:29,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:29,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:48:29,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:48:29,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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:48:29,772 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 [2020-10-19 18:48:29,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:29,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:48:29,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:29,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:29,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:29,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:48:29,775 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 [2020-10-19 18:48:29,780 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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:29,814 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 [2020-10-19 18:48:29,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:29,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:48:29,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:29,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:29,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:29,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:48:29,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:48:29,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 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:29,854 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 [2020-10-19 18:48:29,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:29,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:48:29,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:29,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:29,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:29,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:48:29,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:48:29,862 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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:29,897 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 [2020-10-19 18:48:29,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:29,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:48:29,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:29,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:29,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:29,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:48:29,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:48:29,901 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 [2020-10-19 18:48:29,935 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 [2020-10-19 18:48:29,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:29,937 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:48:29,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:29,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:29,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:29,938 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:48:29,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:48:29,940 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) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:29,970 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 [2020-10-19 18:48:29,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:29,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:48:29,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:29,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:29,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:29,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:48:29,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:48:29,974 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) [2020-10-19 18:48:29,997 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:30,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:30,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:48:30,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:30,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:30,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:30,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:48:30,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:48:30,004 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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:30,036 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 [2020-10-19 18:48:30,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:30,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:30,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:30,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:30,047 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:48:30,047 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:48:30,056 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 [2020-10-19 18:48:30,088 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 [2020-10-19 18:48:30,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:30,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:48:30,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:30,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:48:30,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:30,091 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:48:30,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:48:30,093 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 [2020-10-19 18:48:30,141 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 [2020-10-19 18:48:30,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:48:30,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:48:30,144 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-19 18:48:30,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:48:30,151 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-10-19 18:48:30,151 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-10-19 18:48:30,170 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:48:30,200 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-19 18:48:30,201 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:48:30,219 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:48:30,228 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2020-10-19 18:48:30,228 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:48:30,229 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] [2020-10-19 18:48:30,281 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-10-19 18:48:30,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:48:30,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 18:48:30,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:48:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:48:30,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 18:48:30,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:48:30,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:48:30,446 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 [2020-10-19 18:48:30,447 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states. Second operand 5 states. [2020-10-19 18:48:30,599 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states.. Second operand 5 states. Result 45 states and 54 transitions. Complement of second has 13 states. [2020-10-19 18:48:30,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 18:48:30,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-19 18:48:30,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2020-10-19 18:48:30,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2020-10-19 18:48:30,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:48:30,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2020-10-19 18:48:30,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:48:30,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2020-10-19 18:48:30,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:48:30,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. [2020-10-19 18:48:30,612 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-19 18:48:30,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 29 states and 37 transitions. [2020-10-19 18:48:30,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-10-19 18:48:30,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-10-19 18:48:30,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2020-10-19 18:48:30,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:48:30,625 INFO L691 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2020-10-19 18:48:30,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2020-10-19 18:48:30,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2020-10-19 18:48:30,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-19 18:48:30,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2020-10-19 18:48:30,661 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2020-10-19 18:48:30,661 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2020-10-19 18:48:30,661 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 18:48:30,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2020-10-19 18:48:30,663 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-19 18:48:30,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:48:30,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:48:30,664 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:48:30,664 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 18:48:30,665 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 [2020-10-19 18:48:30,665 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 [2020-10-19 18:48:30,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:30,665 INFO L82 PathProgramCache]: Analyzing trace with hash 772923198, now seen corresponding path program 1 times [2020-10-19 18:48:30,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:30,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993999453] [2020-10-19 18:48:30,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:48:30,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-19 18:48:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:48:30,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:48:30,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993999453] [2020-10-19 18:48:30,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:48:30,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-19 18:48:30,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765092028] [2020-10-19 18:48:30,761 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:48:30,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:30,762 INFO L82 PathProgramCache]: Analyzing trace with hash 2086, now seen corresponding path program 1 times [2020-10-19 18:48:30,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:30,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529620279] [2020-10-19 18:48:30,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:30,768 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:30,771 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:30,773 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:48:30,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:48:30,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-19 18:48:30,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-19 18:48:30,813 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 6 states. [2020-10-19 18:48:30,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:48:30,907 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2020-10-19 18:48:30,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 18:48:30,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2020-10-19 18:48:30,910 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-19 18:48:30,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 28 transitions. [2020-10-19 18:48:30,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-10-19 18:48:30,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-10-19 18:48:30,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2020-10-19 18:48:30,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:48:30,912 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-10-19 18:48:30,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2020-10-19 18:48:30,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-10-19 18:48:30,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-19 18:48:30,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2020-10-19 18:48:30,916 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-10-19 18:48:30,916 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-10-19 18:48:30,916 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 18:48:30,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2020-10-19 18:48:30,917 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-19 18:48:30,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:48:30,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:48:30,918 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:48:30,919 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 18:48:30,919 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 [2020-10-19 18:48:30,919 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 [2020-10-19 18:48:30,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:30,920 INFO L82 PathProgramCache]: Analyzing trace with hash 704779872, now seen corresponding path program 1 times [2020-10-19 18:48:30,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:30,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800285673] [2020-10-19 18:48:30,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:30,938 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:30,954 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:30,962 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:48:30,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:30,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2086, now seen corresponding path program 2 times [2020-10-19 18:48:30,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:30,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904717394] [2020-10-19 18:48:30,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:30,969 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:30,976 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:30,980 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:48:30,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:30,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1311374651, now seen corresponding path program 1 times [2020-10-19 18:48:30,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:30,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493529913] [2020-10-19 18:48:30,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:48:31,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-19 18:48:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:48:31,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-19 18:48:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:48:31,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-19 18:48:31,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493529913] [2020-10-19 18:48:31,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136424848] [2020-10-19 18:48:31,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:48:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:48:31,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 38 conjunts are in the unsatisfiable core [2020-10-19 18:48:31,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:48:31,327 INFO L384 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 [2020-10-19 18:48:31,327 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:48:31,333 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:48:31,334 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-19 18:48:31,334 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-10-19 18:48:31,431 INFO L384 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 13 treesize of output 9 [2020-10-19 18:48:31,432 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:48:31,446 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:48:31,450 INFO L384 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 13 treesize of output 9 [2020-10-19 18:48:31,451 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-19 18:48:31,462 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:48:31,466 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 18:48:31,467 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2020-10-19 18:48:31,685 INFO L384 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 20 treesize of output 14 [2020-10-19 18:48:31,685 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:48:31,714 INFO L625 ElimStorePlain]: treesize reduction 3, result has 93.9 percent of original size [2020-10-19 18:48:31,721 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-19 18:48:31,723 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-10-19 18:48:31,723 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-19 18:48:31,736 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:48:31,740 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-19 18:48:31,742 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:48:31,743 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2020-10-19 18:48:31,743 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-19 18:48:31,752 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:48:31,754 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 18:48:31,754 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:62, output treesize:7 [2020-10-19 18:48:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:48:31,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:48:31,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-10-19 18:48:31,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545995421] [2020-10-19 18:48:31,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:48:31,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-19 18:48:31,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2020-10-19 18:48:31,795 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. cyclomatic complexity: 7 Second operand 17 states. [2020-10-19 18:48:32,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:48:32,333 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2020-10-19 18:48:32,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-19 18:48:32,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2020-10-19 18:48:32,336 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-19 18:48:32,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 40 transitions. [2020-10-19 18:48:32,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2020-10-19 18:48:32,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2020-10-19 18:48:32,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 40 transitions. [2020-10-19 18:48:32,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:48:32,338 INFO L691 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2020-10-19 18:48:32,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 40 transitions. [2020-10-19 18:48:32,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2020-10-19 18:48:32,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-19 18:48:32,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2020-10-19 18:48:32,343 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2020-10-19 18:48:32,343 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2020-10-19 18:48:32,344 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 18:48:32,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2020-10-19 18:48:32,345 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-19 18:48:32,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:48:32,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:48:32,346 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:48:32,346 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:48:32,347 INFO L794 eck$LassoCheckResult]: Stem: 388#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 386#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; 387#L574 assume !(main_~n~0 < 1); 371#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 380#new_llENTRY ~n := #in~n; 392#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); 372#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 381#new_llENTRY ~n := #in~n; 393#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 394#new_llFINAL assume true; 391#new_llEXIT >#53#return; 379#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; 370#new_llFINAL assume true; 373#new_llEXIT >#57#return; 397#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; 396#L563 assume append_~x.base == 0 && append_~x.offset == 0;append_#res.base, append_#res.offset := append_~y.base, append_~y.offset; 378#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; 375#L579 call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset);< 374#lengthENTRY [2020-10-19 18:48:32,347 INFO L796 eck$LassoCheckResult]: Loop: 374#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 377#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); 376#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 374#lengthENTRY [2020-10-19 18:48:32,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:32,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1311376214, now seen corresponding path program 1 times [2020-10-19 18:48:32,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:32,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176526133] [2020-10-19 18:48:32,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:48:32,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-19 18:48:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:48:32,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-19 18:48:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:48:32,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-19 18:48:32,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176526133] [2020-10-19 18:48:32,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:48:32,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-19 18:48:32,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203458518] [2020-10-19 18:48:32,421 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:48:32,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:32,422 INFO L82 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 1 times [2020-10-19 18:48:32,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:32,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718137604] [2020-10-19 18:48:32,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:32,426 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:32,428 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:32,430 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:48:32,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:48:32,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-19 18:48:32,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-19 18:48:32,526 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 9 Second operand 7 states. [2020-10-19 18:48:32,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:48:32,595 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-10-19 18:48:32,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 18:48:32,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 41 transitions. [2020-10-19 18:48:32,597 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-19 18:48:32,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 41 transitions. [2020-10-19 18:48:32,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2020-10-19 18:48:32,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2020-10-19 18:48:32,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 41 transitions. [2020-10-19 18:48:32,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:48:32,600 INFO L691 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2020-10-19 18:48:32,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 41 transitions. [2020-10-19 18:48:32,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2020-10-19 18:48:32,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-19 18:48:32,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-10-19 18:48:32,606 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-10-19 18:48:32,606 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-10-19 18:48:32,606 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 18:48:32,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2020-10-19 18:48:32,607 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-19 18:48:32,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:48:32,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:48:32,609 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:48:32,609 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:48:32,609 INFO L794 eck$LassoCheckResult]: Stem: 485#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 480#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; 481#L574 assume !(main_~n~0 < 1); 469#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 474#new_llENTRY ~n := #in~n; 488#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); 470#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 475#new_llENTRY ~n := #in~n; 489#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 490#new_llFINAL assume true; 486#new_llEXIT >#53#return; 487#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; 494#new_llFINAL assume true; 491#new_llEXIT >#57#return; 476#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; 477#L563 assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; 492#L566-3 call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); 478#L566-1 assume !(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0);havoc append_#t~mem6.base, append_#t~mem6.offset; 479#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; 472#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; 465#L579 call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset);< 464#lengthENTRY [2020-10-19 18:48:32,609 INFO L796 eck$LassoCheckResult]: Loop: 464#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 467#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); 466#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 464#lengthENTRY [2020-10-19 18:48:32,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:32,610 INFO L82 PathProgramCache]: Analyzing trace with hash -139719339, now seen corresponding path program 1 times [2020-10-19 18:48:32,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:32,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759918698] [2020-10-19 18:48:32,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:32,627 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:32,641 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:32,648 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:48:32,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:32,652 INFO L82 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 2 times [2020-10-19 18:48:32,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:32,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198398714] [2020-10-19 18:48:32,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:32,657 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:32,659 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:32,661 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:48:32,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:48:32,662 INFO L82 PathProgramCache]: Analyzing trace with hash -555510211, now seen corresponding path program 1 times [2020-10-19 18:48:32,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:48:32,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245360513] [2020-10-19 18:48:32,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:48:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:32,700 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:48:32,733 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:48:32,747 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:48:33,443 WARN L193 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 111 [2020-10-19 18:48:33,478 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 18:48:33,549 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:48:33,555 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 18:48:33,629 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:48:33,631 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-19 18:48:33,632 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:133, output treesize:109 [2020-10-19 18:48:33,795 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-19 18:48:34,607 WARN L193 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 151 [2020-10-19 18:48:34,649 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 18:48:34,828 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-10-19 18:48:34,829 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:48:34,831 INFO L545 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. [2020-10-19 18:48:34,831 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:220, output treesize:224 [2020-10-19 18:48:34,997 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-10-19 18:48:35,190 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-10-19 18:48:35,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 06:48:35 BoogieIcfgContainer [2020-10-19 18:48:35,289 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 18:48:35,292 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 18:48:35,292 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 18:48:35,292 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 18:48:35,293 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:48:27" (3/4) ... [2020-10-19 18:48:35,296 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-19 18:48:35,375 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-19 18:48:35,375 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 18:48:35,377 INFO L168 Benchmark]: Toolchain (without parser) took 8618.92 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 302.0 MB). Free memory was 958.6 MB in the beginning and 1.1 GB in the end (delta: -107.7 MB). Peak memory consumption was 194.2 MB. Max. memory is 11.5 GB. [2020-10-19 18:48:35,378 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:48:35,379 INFO L168 Benchmark]: CACSL2BoogieTranslator took 597.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -174.6 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2020-10-19 18:48:35,382 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.96 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. [2020-10-19 18:48:35,384 INFO L168 Benchmark]: Boogie Preprocessor took 31.82 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2020-10-19 18:48:35,386 INFO L168 Benchmark]: RCFGBuilder took 442.98 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: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2020-10-19 18:48:35,387 INFO L168 Benchmark]: BuchiAutomizer took 7402.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 156.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.6 MB). Peak memory consumption was 358.3 MB. Max. memory is 11.5 GB. [2020-10-19 18:48:35,387 INFO L168 Benchmark]: Witness Printer took 84.00 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. [2020-10-19 18:48:35,391 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 597.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -174.6 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.96 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. * Boogie Preprocessor took 31.82 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 442.98 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: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7402.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 156.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.6 MB). Peak memory consumption was 358.3 MB. Max. memory is 11.5 GB. * Witness Printer took 84.00 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 17 locations. The remainder module has 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.3s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 6.1s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 61 SDtfs, 61 SDslu, 239 SDs, 0 SdLazy, 305 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital137 mio100 ax100 hnf99 lsp95 ukn27 mio100 lsp38 div100 bol100 ite100 ukn100 eq214 hnf86 smp100 dnf130 smp100 tf100 neg94 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 113ms 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@7d3036aa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@72807768=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@23e48fac=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@23e48fac=0, s=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7bf55c70=0, xs=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5622817c=0, NULL=0, y=0, y=0, \result=0, x=0, y=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@fb58074=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@439a0a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@439a0a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@72807768=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@582f9a4e=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@7bf55c70=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7d3036aa=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...