./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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 Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:37:28,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:37:28,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:37:28,692 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:37:28,693 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:37:28,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:37:28,695 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:37:28,697 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:37:28,699 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:37:28,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:37:28,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:37:28,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:37:28,703 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:37:28,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:37:28,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:37:28,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:37:28,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:37:28,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:37:28,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:37:28,713 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:37:28,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:37:28,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:37:28,718 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:37:28,719 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:37:28,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:37:28,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:37:28,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:37:28,724 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:37:28,724 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:37:28,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:37:28,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:37:28,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:37:28,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:37:28,728 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:37:28,729 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:37:28,730 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:37:28,730 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:37:28,731 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:37:28,731 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:37:28,732 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:37:28,733 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:37:28,734 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:37:28,760 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:37:28,760 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:37:28,762 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:37:28,762 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:37:28,762 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:37:28,762 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:37:28,762 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:37:28,763 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:37:28,763 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:37:28,763 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:37:28,765 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:37:28,765 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:37:28,766 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:37:28,766 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:37:28,766 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:37:28,766 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:37:28,767 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:37:28,767 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:37:28,767 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:37:28,768 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:37:28,768 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:37:28,768 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:37:28,768 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:37:28,769 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:37:28,769 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:37:28,769 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:37:28,769 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:37:28,769 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:37:28,770 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:37:28,771 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:37:28,772 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-07-29 01:37:29,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:37:29,115 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:37:29,118 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:37:29,120 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:37:29,121 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:37:29,122 INFO L429 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-07-29 01:37:29,184 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/646bdac46/5fcae5254a6c417293a23e9059fadd1e/FLAGc08047e8d [2020-07-29 01:37:29,685 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:37:29,687 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i [2020-07-29 01:37:29,706 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/646bdac46/5fcae5254a6c417293a23e9059fadd1e/FLAGc08047e8d [2020-07-29 01:37:30,033 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/646bdac46/5fcae5254a6c417293a23e9059fadd1e [2020-07-29 01:37:30,037 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:37:30,040 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:37:30,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:37:30,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:37:30,045 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:37:30,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:37:30" (1/1) ... [2020-07-29 01:37:30,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12f44fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:30, skipping insertion in model container [2020-07-29 01:37:30,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:37:30" (1/1) ... [2020-07-29 01:37:30,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:37:30,100 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:37:30,540 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:37:30,554 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:37:30,599 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:37:30,675 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:37:30,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:30 WrapperNode [2020-07-29 01:37:30,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:37:30,676 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:37:30,676 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:37:30,677 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:37:30,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:30" (1/1) ... [2020-07-29 01:37:30,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:30" (1/1) ... [2020-07-29 01:37:30,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:37:30,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:37:30,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:37:30,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:37:30,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:30" (1/1) ... [2020-07-29 01:37:30,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:30" (1/1) ... [2020-07-29 01:37:30,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:30" (1/1) ... [2020-07-29 01:37:30,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:30" (1/1) ... [2020-07-29 01:37:30,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:30" (1/1) ... [2020-07-29 01:37:30,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:30" (1/1) ... [2020-07-29 01:37:30,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:30" (1/1) ... [2020-07-29 01:37:30,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:37:30,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:37:30,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:37:30,786 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:37:30,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:30" (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-07-29 01:37:30,876 INFO L130 BoogieDeclarations]: Found specification of procedure new_ll [2020-07-29 01:37:30,877 INFO L138 BoogieDeclarations]: Found implementation of procedure new_ll [2020-07-29 01:37:30,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:37:30,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:37:30,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 01:37:30,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 01:37:30,879 INFO L130 BoogieDeclarations]: Found specification of procedure length [2020-07-29 01:37:30,879 INFO L138 BoogieDeclarations]: Found implementation of procedure length [2020-07-29 01:37:30,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:37:30,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:37:31,346 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:37:31,346 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-29 01:37:31,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:37:31 BoogieIcfgContainer [2020-07-29 01:37:31,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:37:31,351 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:37:31,352 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:37:31,362 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:37:31,364 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:37:31,364 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:37:30" (1/3) ... [2020-07-29 01:37:31,366 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6734688c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:37:31, skipping insertion in model container [2020-07-29 01:37:31,366 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:37:31,366 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:30" (2/3) ... [2020-07-29 01:37:31,367 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6734688c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:37:31, skipping insertion in model container [2020-07-29 01:37:31,367 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:37:31,367 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:37:31" (3/3) ... [2020-07-29 01:37:31,369 INFO L371 chiAutomizerObserver]: Analyzing ICFG ll_append-alloca-2.i [2020-07-29 01:37:31,423 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:37:31,423 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:37:31,423 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:37:31,423 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:37:31,424 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:37:31,424 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:37:31,424 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:37:31,424 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:37:31,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2020-07-29 01:37:31,487 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-07-29 01:37:31,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:31,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:31,495 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:37:31,496 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:37:31,496 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:37:31,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2020-07-29 01:37:31,503 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-07-29 01:37:31,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:31,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:31,504 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:37:31,504 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:37:31,514 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-07-29 01:37:31,514 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-07-29 01:37:31,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:31,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1418244, now seen corresponding path program 1 times [2020-07-29 01:37:31,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:31,535 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782578125] [2020-07-29 01:37:31,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:31,647 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:31,664 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:31,689 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:31,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:31,691 INFO L82 PathProgramCache]: Analyzing trace with hash 29967, now seen corresponding path program 1 times [2020-07-29 01:37:31,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:31,692 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677054916] [2020-07-29 01:37:31,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:31,720 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:31,737 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:31,742 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:31,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:31,744 INFO L82 PathProgramCache]: Analyzing trace with hash -698765780, now seen corresponding path program 1 times [2020-07-29 01:37:31,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:31,745 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475137376] [2020-07-29 01:37:31,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:31,784 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:31,809 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:31,816 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:32,142 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2020-07-29 01:37:32,426 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-07-29 01:37:33,098 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:37:33,099 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:37:33,100 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:37:33,100 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:37:33,100 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:37:33,100 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:33,101 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:37:33,101 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:37:33,101 INFO L133 ssoRankerPreferences]: Filename of dumped script: ll_append-alloca-2.i_Iteration1_Lasso [2020-07-29 01:37:33,101 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:37:33,102 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:37:33,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:33,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:34,163 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:37:34,169 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:34,176 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-07-29 01:37:34,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:34,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:34,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:34,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:34,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:34,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:34,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:34,186 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:34,225 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-07-29 01:37:34,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:34,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:34,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:34,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:34,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:34,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:34,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:34,231 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:34,262 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-07-29 01:37:34,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:34,263 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:34,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:34,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:34,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:34,265 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:34,265 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:34,267 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:34,295 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-07-29 01:37:34,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:34,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:34,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:34,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:34,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:34,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:34,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:34,302 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) [2020-07-29 01:37:34,352 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-07-29 01:37:34,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:34,354 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:34,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:34,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:34,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:34,356 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:34,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:34,360 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) [2020-07-29 01:37:34,408 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-07-29 01:37:34,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:34,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:34,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:34,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:34,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:34,413 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:34,413 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:34,416 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-07-29 01:37:34,460 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-07-29 01:37:34,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:34,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:34,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:34,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:34,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:34,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:34,465 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:34,468 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:34,508 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-07-29 01:37:34,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:34,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:34,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:34,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:34,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:34,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:34,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:34,515 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-07-29 01:37:34,539 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:34,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:34,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:34,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:34,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:34,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:34,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:34,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:34,546 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-07-29 01:37:34,569 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-07-29 01:37:34,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:34,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:34,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:34,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:34,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:34,572 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:34,572 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:34,579 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-07-29 01:37:34,615 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-07-29 01:37:34,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:34,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:34,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:34,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:34,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:34,618 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:34,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:34,620 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-07-29 01:37:34,645 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-07-29 01:37:34,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:34,647 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:34,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:34,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:34,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:34,648 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:34,648 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:34,650 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-07-29 01:37:34,695 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-07-29 01:37:34,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:34,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:34,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:34,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:34,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:34,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:34,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:34,702 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-07-29 01:37:34,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:34,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:34,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:34,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:34,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:34,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:34,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:34,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:34,736 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:34,762 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-07-29 01:37:34,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:34,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:34,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:34,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:34,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:34,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:34,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:34,767 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-07-29 01:37:34,792 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-07-29 01:37:34,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:34,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:34,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:34,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:34,797 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:34,797 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:34,802 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-07-29 01:37:34,827 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-07-29 01:37:34,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:34,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:34,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:34,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:34,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:34,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:34,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:34,831 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-07-29 01:37:34,856 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-07-29 01:37:34,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:34,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:34,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:34,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:34,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:34,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:34,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:34,861 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:34,886 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-07-29 01:37:34,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:34,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:34,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:34,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:34,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:34,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:34,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:34,892 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:34,915 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-07-29 01:37:34,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:34,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:34,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:34,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:34,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:34,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:34,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:34,918 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:34,943 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-07-29 01:37:34,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:34,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:34,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:34,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:34,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:34,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:34,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:34,947 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:34,986 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-07-29 01:37:34,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:34,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:34,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:34,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:34,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:34,991 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:34,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:34,998 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 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:35,024 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-07-29 01:37:35,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:35,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:35,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:35,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:35,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:35,027 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:35,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:35,028 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 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:35,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:35,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:35,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:35,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:35,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:35,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:35,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:35,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:35,055 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 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:35,078 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-07-29 01:37:35,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:35,080 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:35,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:35,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:35,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:35,081 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:35,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:35,083 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 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:35,106 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-07-29 01:37:35,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:35,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:35,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:35,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:35,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:35,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:35,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:35,116 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 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:35,140 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-07-29 01:37:35,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:35,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:35,142 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:37:35,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:35,148 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-07-29 01:37:35,148 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 01:37:35,160 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 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:35,184 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-07-29 01:37:35,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:35,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:35,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:35,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:35,190 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:35,190 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:35,196 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 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:35,220 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-07-29 01:37:35,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:35,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:35,221 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:37:35,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:35,231 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-07-29 01:37:35,231 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 01:37:35,247 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:37:35,283 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-07-29 01:37:35,284 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:35,294 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:35,301 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2020-07-29 01:37:35,301 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:37:35,302 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-07-29 01:37:35,348 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:37:35,357 INFO L393 LassoCheck]: Loop: "~n := #in~n;" "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);" "call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);"< [2020-07-29 01:37:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:35,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:35,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:37:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:35,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:35,501 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {37#unseeded} is VALID [2020-07-29 01:37:35,502 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#unseeded} 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; {37#unseeded} is VALID [2020-07-29 01:37:35,503 INFO L280 TraceCheckUtils]: 2: Hoare triple {37#unseeded} assume !(main_~n~0 < 1); {71#(and (<= 1 ULTIMATE.start_main_~n~0) unseeded)} is VALID [2020-07-29 01:37:35,505 INFO L263 TraceCheckUtils]: 3: Hoare triple {71#(and (<= 1 ULTIMATE.start_main_~n~0) unseeded)} call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); {56#(and (>= |new_ll_#in~n| 0) unseeded)} is VALID [2020-07-29 01:37:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:35,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:37:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:35,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:35,595 INFO L280 TraceCheckUtils]: 0: Hoare triple {57#(and (>= oldRank0 |new_ll_#in~n|) (>= |new_ll_#in~n| 0))} ~n := #in~n; {75#(and (<= new_ll_~n oldRank0) (<= 0 new_ll_~n))} is VALID [2020-07-29 01:37:35,597 INFO L280 TraceCheckUtils]: 1: Hoare triple {75#(and (<= new_ll_~n oldRank0) (<= 0 new_ll_~n))} 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); {79#(and (<= new_ll_~n oldRank0) (not (= 0 new_ll_~n)) (<= 0 new_ll_~n))} is VALID [2020-07-29 01:37:35,599 INFO L263 TraceCheckUtils]: 2: Hoare triple {79#(and (<= new_ll_~n oldRank0) (not (= 0 new_ll_~n)) (<= 0 new_ll_~n))} call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); {59#(and (>= |new_ll_#in~n| 0) (or (and (> oldRank0 |new_ll_#in~n|) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:37:35,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:35,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:37:35,633 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:35,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:37:35,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,644 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-07-29 01:37:35,646 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states. Second operand 5 states. [2020-07-29 01:37:35,893 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-07-29 01:37:35,894 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-07-29 01:37:35,894 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:35,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2020-07-29 01:37:35,900 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-07-29 01:37:35,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:35,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:35,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:37:35,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:35,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:35,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:35,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2020-07-29 01:37:35,908 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:37:35,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:35,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:35,912 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states. [2020-07-29 01:37:35,917 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-07-29 01:37:35,921 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:37:35,921 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:37:35,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:35,923 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:37:35,923 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 54 transitions. cyclomatic complexity: 12 [2020-07-29 01:37:35,926 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:37:35,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:37:35,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:37:35,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:37:35,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:37:35,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:37:35,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:37:35,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:37:35,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:37:35,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:37:35,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:37:35,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:37:35,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:37:35,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:37:35,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:37:35,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:37:35,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:37:35,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:37:35,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:37:35,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:37:35,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:37:35,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:37:35,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:37:35,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:37:35,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:37:35,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:37:35,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:37:35,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:37:35,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:37:35,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:37:35,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:37:35,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:37:35,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:37:35,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:37:35,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:35,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:35,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:35,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:37:35,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:37:35,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:37:35,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:37:35,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:37:35,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:37:35,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:37:35,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:37:35,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:37:35,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:37:35,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:37:35,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:37:35,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:37:35,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:37:35,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:37:35,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:35,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:35,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:35,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:37:35,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:37:35,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:37:35,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:37:35,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:37:35,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:37:35,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,960 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:35,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:37:35,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2020-07-29 01:37:35,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:37:35,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:35,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:37:35,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:35,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. cyclomatic complexity: 12 [2020-07-29 01:37:35,974 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:37:35,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 29 states and 37 transitions. [2020-07-29 01:37:35,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-07-29 01:37:35,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-07-29 01:37:35,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2020-07-29 01:37:35,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:37:35,986 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2020-07-29 01:37:36,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2020-07-29 01:37:36,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2020-07-29 01:37:36,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:36,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states and 37 transitions. Second operand 27 states. [2020-07-29 01:37:36,023 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states and 37 transitions. Second operand 27 states. [2020-07-29 01:37:36,026 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 27 states. [2020-07-29 01:37:36,030 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:36,037 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2020-07-29 01:37:36,038 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2020-07-29 01:37:36,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:36,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:36,040 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states and 37 transitions. [2020-07-29 01:37:36,040 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states and 37 transitions. [2020-07-29 01:37:36,041 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:36,047 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2020-07-29 01:37:36,048 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2020-07-29 01:37:36,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:36,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:36,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:36,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:36,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-29 01:37:36,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2020-07-29 01:37:36,054 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2020-07-29 01:37:36,054 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2020-07-29 01:37:36,054 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:37:36,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2020-07-29 01:37:36,056 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:37:36,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:36,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:36,057 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:37:36,057 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:37:36,058 INFO L794 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 166#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; 167#L574 assume !(main_~n~0 < 1); 149#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 159#new_llENTRY ~n := #in~n; 171#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 148#new_llFINAL assume true; 150#new_llEXIT >#57#return; 161#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; 162#L563 assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; 165#L566-3 [2020-07-29 01:37:36,058 INFO L796 eck$LassoCheckResult]: Loop: 165#L566-3 call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); 163#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; 165#L566-3 [2020-07-29 01:37:36,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:36,059 INFO L82 PathProgramCache]: Analyzing trace with hash 772923198, now seen corresponding path program 1 times [2020-07-29 01:37:36,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:36,060 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856277895] [2020-07-29 01:37:36,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:36,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 01:37:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:36,219 INFO L280 TraceCheckUtils]: 0: Hoare triple {352#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~n := #in~n; {353#(= new_ll_~n |new_ll_#in~n|)} is VALID [2020-07-29 01:37:36,220 INFO L280 TraceCheckUtils]: 1: Hoare triple {353#(= new_ll_~n |new_ll_#in~n|)} assume 0 == ~n;#res.base, #res.offset := 0, 0; {354#(= 0 |new_ll_#in~n|)} is VALID [2020-07-29 01:37:36,220 INFO L280 TraceCheckUtils]: 2: Hoare triple {354#(= 0 |new_ll_#in~n|)} assume true; {354#(= 0 |new_ll_#in~n|)} is VALID [2020-07-29 01:37:36,222 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {354#(= 0 |new_ll_#in~n|)} {347#(not (= 0 ULTIMATE.start_main_~n~0))} #57#return; {346#false} is VALID [2020-07-29 01:37:36,223 INFO L280 TraceCheckUtils]: 0: Hoare triple {345#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {345#true} is VALID [2020-07-29 01:37:36,224 INFO L280 TraceCheckUtils]: 1: Hoare triple {345#true} havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; {345#true} is VALID [2020-07-29 01:37:36,224 INFO L280 TraceCheckUtils]: 2: Hoare triple {345#true} assume !(main_~n~0 < 1); {347#(not (= 0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 01:37:36,226 INFO L263 TraceCheckUtils]: 3: Hoare triple {347#(not (= 0 ULTIMATE.start_main_~n~0))} call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); {352#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-29 01:37:36,227 INFO L280 TraceCheckUtils]: 4: Hoare triple {352#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~n := #in~n; {353#(= new_ll_~n |new_ll_#in~n|)} is VALID [2020-07-29 01:37:36,228 INFO L280 TraceCheckUtils]: 5: Hoare triple {353#(= new_ll_~n |new_ll_#in~n|)} assume 0 == ~n;#res.base, #res.offset := 0, 0; {354#(= 0 |new_ll_#in~n|)} is VALID [2020-07-29 01:37:36,228 INFO L280 TraceCheckUtils]: 6: Hoare triple {354#(= 0 |new_ll_#in~n|)} assume true; {354#(= 0 |new_ll_#in~n|)} is VALID [2020-07-29 01:37:36,230 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {354#(= 0 |new_ll_#in~n|)} {347#(not (= 0 ULTIMATE.start_main_~n~0))} #57#return; {346#false} is VALID [2020-07-29 01:37:36,230 INFO L280 TraceCheckUtils]: 8: Hoare triple {346#false} 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; {346#false} is VALID [2020-07-29 01:37:36,231 INFO L280 TraceCheckUtils]: 9: Hoare triple {346#false} assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; {346#false} is VALID [2020-07-29 01:37:36,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:36,232 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856277895] [2020-07-29 01:37:36,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:37:36,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:37:36,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725703862] [2020-07-29 01:37:36,237 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:37:36,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:36,237 INFO L82 PathProgramCache]: Analyzing trace with hash 2086, now seen corresponding path program 1 times [2020-07-29 01:37:36,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:36,238 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561164093] [2020-07-29 01:37:36,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:36,245 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:36,249 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:36,252 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:36,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:37:36,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:37:36,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:37:36,313 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 6 states. [2020-07-29 01:37:36,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:36,640 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2020-07-29 01:37:36,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:37:36,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:37:36,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:36,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2020-07-29 01:37:36,660 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:37:36,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 28 transitions. [2020-07-29 01:37:36,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-07-29 01:37:36,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-07-29 01:37:36,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2020-07-29 01:37:36,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:37:36,664 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-07-29 01:37:36,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2020-07-29 01:37:36,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-29 01:37:36,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:36,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 28 transitions. Second operand 24 states. [2020-07-29 01:37:36,667 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 28 transitions. Second operand 24 states. [2020-07-29 01:37:36,667 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 24 states. [2020-07-29 01:37:36,668 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:36,673 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2020-07-29 01:37:36,673 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2020-07-29 01:37:36,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:36,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:36,674 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states and 28 transitions. [2020-07-29 01:37:36,675 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states and 28 transitions. [2020-07-29 01:37:36,675 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:36,680 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2020-07-29 01:37:36,680 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2020-07-29 01:37:36,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:36,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:36,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:36,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:36,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:37:36,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2020-07-29 01:37:36,684 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-07-29 01:37:36,684 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-07-29 01:37:36,684 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:37:36,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2020-07-29 01:37:36,685 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:37:36,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:36,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:36,686 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:37:36,687 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:37:36,687 INFO L794 eck$LassoCheckResult]: Stem: 408#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 406#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; 407#L574 assume !(main_~n~0 < 1); 397#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 399#new_llENTRY ~n := #in~n; 409#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); 393#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 400#new_llENTRY ~n := #in~n; 410#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 392#new_llFINAL assume true; 394#new_llEXIT >#53#return; 396#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; 398#new_llFINAL assume true; 411#new_llEXIT >#57#return; 401#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; 402#L563 assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; 405#L566-3 [2020-07-29 01:37:36,687 INFO L796 eck$LassoCheckResult]: Loop: 405#L566-3 call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); 403#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; 405#L566-3 [2020-07-29 01:37:36,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:36,688 INFO L82 PathProgramCache]: Analyzing trace with hash 704779872, now seen corresponding path program 1 times [2020-07-29 01:37:36,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:36,688 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404919137] [2020-07-29 01:37:36,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:36,726 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:36,772 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:36,790 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:36,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:36,791 INFO L82 PathProgramCache]: Analyzing trace with hash 2086, now seen corresponding path program 2 times [2020-07-29 01:37:36,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:36,791 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444565953] [2020-07-29 01:37:36,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:36,799 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:36,808 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:36,812 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:36,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:36,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1311374651, now seen corresponding path program 1 times [2020-07-29 01:37:36,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:36,813 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646621056] [2020-07-29 01:37:36,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:36,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 01:37:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:37,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-29 01:37:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:37,133 INFO L280 TraceCheckUtils]: 0: Hoare triple {580#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~n := #in~n; {565#true} is VALID [2020-07-29 01:37:37,134 INFO L280 TraceCheckUtils]: 1: Hoare triple {565#true} assume 0 == ~n;#res.base, #res.offset := 0, 0; {588#(and (<= 0 |new_ll_#res.base|) (<= |new_ll_#res.offset| 0) (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.offset|))} is VALID [2020-07-29 01:37:37,135 INFO L280 TraceCheckUtils]: 2: Hoare triple {588#(and (<= 0 |new_ll_#res.base|) (<= |new_ll_#res.offset| 0) (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.offset|))} assume true; {588#(and (<= 0 |new_ll_#res.base|) (<= |new_ll_#res.offset| 0) (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.offset|))} is VALID [2020-07-29 01:37:37,137 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {588#(and (<= 0 |new_ll_#res.base|) (<= |new_ll_#res.offset| 0) (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.offset|))} {581#(= new_ll_~head~0.offset 0)} #53#return; {586#(and (= new_ll_~head~0.offset 0) (= 0 |new_ll_#t~ret3.offset|) (= 0 |new_ll_#t~ret3.base|))} is VALID [2020-07-29 01:37:37,137 INFO L280 TraceCheckUtils]: 0: Hoare triple {580#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~n := #in~n; {565#true} is VALID [2020-07-29 01:37:37,139 INFO L280 TraceCheckUtils]: 1: Hoare triple {565#true} 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); {581#(= new_ll_~head~0.offset 0)} is VALID [2020-07-29 01:37:37,141 INFO L263 TraceCheckUtils]: 2: Hoare triple {581#(= new_ll_~head~0.offset 0)} call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); {580#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-29 01:37:37,142 INFO L280 TraceCheckUtils]: 3: Hoare triple {580#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~n := #in~n; {565#true} is VALID [2020-07-29 01:37:37,143 INFO L280 TraceCheckUtils]: 4: Hoare triple {565#true} assume 0 == ~n;#res.base, #res.offset := 0, 0; {588#(and (<= 0 |new_ll_#res.base|) (<= |new_ll_#res.offset| 0) (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.offset|))} is VALID [2020-07-29 01:37:37,144 INFO L280 TraceCheckUtils]: 5: Hoare triple {588#(and (<= 0 |new_ll_#res.base|) (<= |new_ll_#res.offset| 0) (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.offset|))} assume true; {588#(and (<= 0 |new_ll_#res.base|) (<= |new_ll_#res.offset| 0) (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.offset|))} is VALID [2020-07-29 01:37:37,146 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {588#(and (<= 0 |new_ll_#res.base|) (<= |new_ll_#res.offset| 0) (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.offset|))} {581#(= new_ll_~head~0.offset 0)} #53#return; {586#(and (= new_ll_~head~0.offset 0) (= 0 |new_ll_#t~ret3.offset|) (= 0 |new_ll_#t~ret3.base|))} is VALID [2020-07-29 01:37:37,149 INFO L280 TraceCheckUtils]: 7: Hoare triple {586#(and (= new_ll_~head~0.offset 0) (= 0 |new_ll_#t~ret3.offset|) (= 0 |new_ll_#t~ret3.base|))} 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; {587#(and (= 0 (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) 4)) (= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) 4) 0) (= 0 |new_ll_#res.offset|))} is VALID [2020-07-29 01:37:37,150 INFO L280 TraceCheckUtils]: 8: Hoare triple {587#(and (= 0 (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) 4)) (= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) 4) 0) (= 0 |new_ll_#res.offset|))} assume true; {587#(and (= 0 (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) 4)) (= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) 4) 0) (= 0 |new_ll_#res.offset|))} is VALID [2020-07-29 01:37:37,152 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {587#(and (= 0 (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) 4)) (= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) 4) 0) (= 0 |new_ll_#res.offset|))} {565#true} #57#return; {577#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~ret9.base|) 4)) (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~ret9.base|) 4)) (= 0 |ULTIMATE.start_main_#t~ret9.offset|))} is VALID [2020-07-29 01:37:37,154 INFO L280 TraceCheckUtils]: 0: Hoare triple {565#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {565#true} is VALID [2020-07-29 01:37:37,154 INFO L280 TraceCheckUtils]: 1: Hoare triple {565#true} havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; {565#true} is VALID [2020-07-29 01:37:37,154 INFO L280 TraceCheckUtils]: 2: Hoare triple {565#true} assume !(main_~n~0 < 1); {565#true} is VALID [2020-07-29 01:37:37,156 INFO L263 TraceCheckUtils]: 3: Hoare triple {565#true} call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); {580#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-29 01:37:37,157 INFO L280 TraceCheckUtils]: 4: Hoare triple {580#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~n := #in~n; {565#true} is VALID [2020-07-29 01:37:37,159 INFO L280 TraceCheckUtils]: 5: Hoare triple {565#true} 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); {581#(= new_ll_~head~0.offset 0)} is VALID [2020-07-29 01:37:37,161 INFO L263 TraceCheckUtils]: 6: Hoare triple {581#(= new_ll_~head~0.offset 0)} call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); {580#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-29 01:37:37,161 INFO L280 TraceCheckUtils]: 7: Hoare triple {580#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~n := #in~n; {565#true} is VALID [2020-07-29 01:37:37,162 INFO L280 TraceCheckUtils]: 8: Hoare triple {565#true} assume 0 == ~n;#res.base, #res.offset := 0, 0; {588#(and (<= 0 |new_ll_#res.base|) (<= |new_ll_#res.offset| 0) (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.offset|))} is VALID [2020-07-29 01:37:37,164 INFO L280 TraceCheckUtils]: 9: Hoare triple {588#(and (<= 0 |new_ll_#res.base|) (<= |new_ll_#res.offset| 0) (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.offset|))} assume true; {588#(and (<= 0 |new_ll_#res.base|) (<= |new_ll_#res.offset| 0) (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.offset|))} is VALID [2020-07-29 01:37:37,167 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {588#(and (<= 0 |new_ll_#res.base|) (<= |new_ll_#res.offset| 0) (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.offset|))} {581#(= new_ll_~head~0.offset 0)} #53#return; {586#(and (= new_ll_~head~0.offset 0) (= 0 |new_ll_#t~ret3.offset|) (= 0 |new_ll_#t~ret3.base|))} is VALID [2020-07-29 01:37:37,169 INFO L280 TraceCheckUtils]: 11: Hoare triple {586#(and (= new_ll_~head~0.offset 0) (= 0 |new_ll_#t~ret3.offset|) (= 0 |new_ll_#t~ret3.base|))} 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; {587#(and (= 0 (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) 4)) (= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) 4) 0) (= 0 |new_ll_#res.offset|))} is VALID [2020-07-29 01:37:37,171 INFO L280 TraceCheckUtils]: 12: Hoare triple {587#(and (= 0 (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) 4)) (= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) 4) 0) (= 0 |new_ll_#res.offset|))} assume true; {587#(and (= 0 (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) 4)) (= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) 4) 0) (= 0 |new_ll_#res.offset|))} is VALID [2020-07-29 01:37:37,174 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {587#(and (= 0 (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) 4)) (= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) 4) 0) (= 0 |new_ll_#res.offset|))} {565#true} #57#return; {577#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~ret9.base|) 4)) (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~ret9.base|) 4)) (= 0 |ULTIMATE.start_main_#t~ret9.offset|))} is VALID [2020-07-29 01:37:37,176 INFO L280 TraceCheckUtils]: 14: Hoare triple {577#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~ret9.base|) 4)) (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~ret9.base|) 4)) (= 0 |ULTIMATE.start_main_#t~ret9.offset|))} 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; {578#(and (= 0 ULTIMATE.start_append_~x.offset) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_append_~x.base) (+ ULTIMATE.start_append_~x.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_append_~x.base) (+ ULTIMATE.start_append_~x.offset 4))))} is VALID [2020-07-29 01:37:37,182 INFO L280 TraceCheckUtils]: 15: Hoare triple {578#(and (= 0 ULTIMATE.start_append_~x.offset) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_append_~x.base) (+ ULTIMATE.start_append_~x.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_append_~x.base) (+ ULTIMATE.start_append_~x.offset 4))))} assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; {578#(and (= 0 ULTIMATE.start_append_~x.offset) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_append_~x.base) (+ ULTIMATE.start_append_~x.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_append_~x.base) (+ ULTIMATE.start_append_~x.offset 4))))} is VALID [2020-07-29 01:37:37,184 INFO L280 TraceCheckUtils]: 16: Hoare triple {578#(and (= 0 ULTIMATE.start_append_~x.offset) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_append_~x.base) (+ ULTIMATE.start_append_~x.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_append_~x.base) (+ ULTIMATE.start_append_~x.offset 4))))} call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); {579#(and (= 0 |ULTIMATE.start_append_#t~mem6.offset|) (= 0 |ULTIMATE.start_append_#t~mem6.base|))} is VALID [2020-07-29 01:37:37,186 INFO L280 TraceCheckUtils]: 17: Hoare triple {579#(and (= 0 |ULTIMATE.start_append_#t~mem6.offset|) (= 0 |ULTIMATE.start_append_#t~mem6.base|))} 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; {566#false} is VALID [2020-07-29 01:37:37,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:37:37,191 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646621056] [2020-07-29 01:37:37,191 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936832029] [2020-07-29 01:37:37,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:37:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:37,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 35 conjunts are in the unsatisfiable core [2020-07-29 01:37:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:37,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:37,514 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-07-29 01:37:37,515 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:37:37,533 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:37:37,541 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-07-29 01:37:37,541 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:37:37,558 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:37:37,565 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:37:37,565 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:37 [2020-07-29 01:37:37,572 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:37:37,572 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_31|, |v_new_ll_#t~ret3.base_8|, |v_new_ll_#t~ret3.offset_8|, |v_#memory_$Pointer$.offset_31|]. (let ((.cse0 (+ |new_ll_#res.offset| 4))) (and (<= 0 |v_new_ll_#t~ret3.base_8|) (= (store |v_#memory_$Pointer$.base_31| |new_ll_#res.base| (store (select |v_#memory_$Pointer$.base_31| |new_ll_#res.base|) .cse0 |v_new_ll_#t~ret3.base_8|)) |#memory_$Pointer$.base|) (<= |v_new_ll_#t~ret3.offset_8| 0) (<= |v_new_ll_#t~ret3.base_8| 0) (<= 0 |v_new_ll_#t~ret3.offset_8|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_31| |new_ll_#res.base| (store (select |v_#memory_$Pointer$.offset_31| |new_ll_#res.base|) .cse0 |v_new_ll_#t~ret3.offset_8|))))) [2020-07-29 01:37:37,573 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse2 (+ |new_ll_#res.offset| 4))) (let ((.cse0 (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) .cse2)) (.cse1 (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) .cse2))) (and (<= .cse0 0) (<= .cse1 0) (<= 0 .cse0) (<= 0 .cse1)))) [2020-07-29 01:37:37,747 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2020-07-29 01:37:37,749 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:37:37,766 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:37:37,770 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2020-07-29 01:37:37,772 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:37:37,788 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:37:37,789 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:37:37,789 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:13 [2020-07-29 01:37:37,792 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:37:37,793 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.offset|, ULTIMATE.start_append_~x.base, ULTIMATE.start_append_~x.offset, |#memory_$Pointer$.base|]. (let ((.cse2 (+ ULTIMATE.start_append_~x.offset 4))) (let ((.cse0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_append_~x.base) .cse2)) (.cse1 (select (select |#memory_$Pointer$.base| ULTIMATE.start_append_~x.base) .cse2))) (and (= .cse0 |ULTIMATE.start_append_#t~mem6.offset|) (<= .cse0 0) (<= 0 .cse0) (= .cse1 |ULTIMATE.start_append_#t~mem6.base|) (<= .cse1 0) (<= 0 .cse1)))) [2020-07-29 01:37:37,793 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= |ULTIMATE.start_append_#t~mem6.base| 0) (<= 0 |ULTIMATE.start_append_#t~mem6.base|) (<= 0 |ULTIMATE.start_append_#t~mem6.offset|) (<= |ULTIMATE.start_append_#t~mem6.offset| 0)) [2020-07-29 01:37:37,802 INFO L280 TraceCheckUtils]: 0: Hoare triple {565#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {565#true} is VALID [2020-07-29 01:37:37,802 INFO L280 TraceCheckUtils]: 1: Hoare triple {565#true} havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; {565#true} is VALID [2020-07-29 01:37:37,802 INFO L280 TraceCheckUtils]: 2: Hoare triple {565#true} assume !(main_~n~0 < 1); {565#true} is VALID [2020-07-29 01:37:37,803 INFO L263 TraceCheckUtils]: 3: Hoare triple {565#true} call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); {565#true} is VALID [2020-07-29 01:37:37,803 INFO L280 TraceCheckUtils]: 4: Hoare triple {565#true} ~n := #in~n; {565#true} is VALID [2020-07-29 01:37:37,804 INFO L280 TraceCheckUtils]: 5: Hoare triple {565#true} 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); {565#true} is VALID [2020-07-29 01:37:37,804 INFO L263 TraceCheckUtils]: 6: Hoare triple {565#true} call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); {565#true} is VALID [2020-07-29 01:37:37,805 INFO L280 TraceCheckUtils]: 7: Hoare triple {565#true} ~n := #in~n; {565#true} is VALID [2020-07-29 01:37:37,808 INFO L280 TraceCheckUtils]: 8: Hoare triple {565#true} assume 0 == ~n;#res.base, #res.offset := 0, 0; {588#(and (<= 0 |new_ll_#res.base|) (<= |new_ll_#res.offset| 0) (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.offset|))} is VALID [2020-07-29 01:37:37,810 INFO L280 TraceCheckUtils]: 9: Hoare triple {588#(and (<= 0 |new_ll_#res.base|) (<= |new_ll_#res.offset| 0) (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.offset|))} assume true; {588#(and (<= 0 |new_ll_#res.base|) (<= |new_ll_#res.offset| 0) (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.offset|))} is VALID [2020-07-29 01:37:37,812 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {588#(and (<= 0 |new_ll_#res.base|) (<= |new_ll_#res.offset| 0) (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.offset|))} {565#true} #53#return; {622#(and (<= |new_ll_#t~ret3.offset| 0) (<= 0 |new_ll_#t~ret3.base|) (<= |new_ll_#t~ret3.base| 0) (<= 0 |new_ll_#t~ret3.offset|))} is VALID [2020-07-29 01:37:37,814 INFO L280 TraceCheckUtils]: 11: Hoare triple {622#(and (<= |new_ll_#t~ret3.offset| 0) (<= 0 |new_ll_#t~ret3.base|) (<= |new_ll_#t~ret3.base| 0) (<= 0 |new_ll_#t~ret3.offset|))} 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; {626#(and (<= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0) (<= (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0) (<= 0 (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4))) (<= 0 (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4))))} is VALID [2020-07-29 01:37:37,816 INFO L280 TraceCheckUtils]: 12: Hoare triple {626#(and (<= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0) (<= (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0) (<= 0 (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4))) (<= 0 (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4))))} assume true; {626#(and (<= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0) (<= (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0) (<= 0 (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4))) (<= 0 (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4))))} is VALID [2020-07-29 01:37:37,818 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {626#(and (<= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0) (<= (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0) (<= 0 (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4))) (<= 0 (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4))))} {565#true} #57#return; {633#(and (<= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~ret9.base|) (+ |ULTIMATE.start_main_#t~ret9.offset| 4))) (<= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~ret9.base|) (+ |ULTIMATE.start_main_#t~ret9.offset| 4)) 0) (<= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~ret9.base|) (+ |ULTIMATE.start_main_#t~ret9.offset| 4)) 0) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~ret9.base|) (+ |ULTIMATE.start_main_#t~ret9.offset| 4))))} is VALID [2020-07-29 01:37:37,820 INFO L280 TraceCheckUtils]: 14: Hoare triple {633#(and (<= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~ret9.base|) (+ |ULTIMATE.start_main_#t~ret9.offset| 4))) (<= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~ret9.base|) (+ |ULTIMATE.start_main_#t~ret9.offset| 4)) 0) (<= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~ret9.base|) (+ |ULTIMATE.start_main_#t~ret9.offset| 4)) 0) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~ret9.base|) (+ |ULTIMATE.start_main_#t~ret9.offset| 4))))} 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; {637#(and (<= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_append_~x.base) (+ ULTIMATE.start_append_~x.offset 4)) 0) (<= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_append_~x.base) (+ ULTIMATE.start_append_~x.offset 4))) (<= (select (select |#memory_$Pointer$.base| ULTIMATE.start_append_~x.base) (+ ULTIMATE.start_append_~x.offset 4)) 0) (<= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_append_~x.base) (+ ULTIMATE.start_append_~x.offset 4))))} is VALID [2020-07-29 01:37:37,822 INFO L280 TraceCheckUtils]: 15: Hoare triple {637#(and (<= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_append_~x.base) (+ ULTIMATE.start_append_~x.offset 4)) 0) (<= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_append_~x.base) (+ ULTIMATE.start_append_~x.offset 4))) (<= (select (select |#memory_$Pointer$.base| ULTIMATE.start_append_~x.base) (+ ULTIMATE.start_append_~x.offset 4)) 0) (<= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_append_~x.base) (+ ULTIMATE.start_append_~x.offset 4))))} assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; {637#(and (<= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_append_~x.base) (+ ULTIMATE.start_append_~x.offset 4)) 0) (<= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_append_~x.base) (+ ULTIMATE.start_append_~x.offset 4))) (<= (select (select |#memory_$Pointer$.base| ULTIMATE.start_append_~x.base) (+ ULTIMATE.start_append_~x.offset 4)) 0) (<= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_append_~x.base) (+ ULTIMATE.start_append_~x.offset 4))))} is VALID [2020-07-29 01:37:37,824 INFO L280 TraceCheckUtils]: 16: Hoare triple {637#(and (<= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_append_~x.base) (+ ULTIMATE.start_append_~x.offset 4)) 0) (<= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_append_~x.base) (+ ULTIMATE.start_append_~x.offset 4))) (<= (select (select |#memory_$Pointer$.base| ULTIMATE.start_append_~x.base) (+ ULTIMATE.start_append_~x.offset 4)) 0) (<= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_append_~x.base) (+ ULTIMATE.start_append_~x.offset 4))))} call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); {579#(and (= 0 |ULTIMATE.start_append_#t~mem6.offset|) (= 0 |ULTIMATE.start_append_#t~mem6.base|))} is VALID [2020-07-29 01:37:37,825 INFO L280 TraceCheckUtils]: 17: Hoare triple {579#(and (= 0 |ULTIMATE.start_append_#t~mem6.offset|) (= 0 |ULTIMATE.start_append_#t~mem6.base|))} 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; {566#false} is VALID [2020-07-29 01:37:37,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:37:37,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:37:37,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2020-07-29 01:37:37,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278797253] [2020-07-29 01:37:37,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:37:37,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-29 01:37:37,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-07-29 01:37:37,878 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. cyclomatic complexity: 7 Second operand 14 states. [2020-07-29 01:37:38,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:38,770 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2020-07-29 01:37:38,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:37:38,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-29 01:37:38,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:38,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2020-07-29 01:37:38,824 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:37:38,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 40 transitions. [2020-07-29 01:37:38,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2020-07-29 01:37:38,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2020-07-29 01:37:38,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 40 transitions. [2020-07-29 01:37:38,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:37:38,830 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2020-07-29 01:37:38,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 40 transitions. [2020-07-29 01:37:38,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2020-07-29 01:37:38,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:38,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states and 40 transitions. Second operand 31 states. [2020-07-29 01:37:38,834 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states and 40 transitions. Second operand 31 states. [2020-07-29 01:37:38,834 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 31 states. [2020-07-29 01:37:38,835 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:38,839 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2020-07-29 01:37:38,839 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2020-07-29 01:37:38,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:38,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:38,840 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 34 states and 40 transitions. [2020-07-29 01:37:38,840 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 34 states and 40 transitions. [2020-07-29 01:37:38,841 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:38,845 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2020-07-29 01:37:38,845 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2020-07-29 01:37:38,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:38,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:38,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:38,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:38,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-29 01:37:38,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2020-07-29 01:37:38,848 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2020-07-29 01:37:38,849 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2020-07-29 01:37:38,849 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:37:38,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2020-07-29 01:37:38,850 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:37:38,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:38,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:38,850 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:37:38,850 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:37:38,851 INFO L794 eck$LassoCheckResult]: Stem: 702#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 700#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; 701#L574 assume !(main_~n~0 < 1); 686#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 694#new_llENTRY ~n := #in~n; 706#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); 685#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 695#new_llENTRY ~n := #in~n; 707#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 708#new_llFINAL assume true; 705#new_llEXIT >#53#return; 693#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; 684#new_llFINAL assume true; 687#new_llEXIT >#57#return; 711#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; 710#L563 assume append_~x.base == 0 && append_~x.offset == 0;append_#res.base, append_#res.offset := append_~y.base, append_~y.offset; 692#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; 690#L579 call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset);< 688#lengthENTRY [2020-07-29 01:37:38,851 INFO L796 eck$LassoCheckResult]: Loop: 688#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 691#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); 689#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 688#lengthENTRY [2020-07-29 01:37:38,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:38,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1311376214, now seen corresponding path program 1 times [2020-07-29 01:37:38,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:38,852 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57783554] [2020-07-29 01:37:38,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:38,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 01:37:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:39,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-29 01:37:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:39,009 INFO L280 TraceCheckUtils]: 0: Hoare triple {933#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~n := #in~n; {919#true} is VALID [2020-07-29 01:37:39,009 INFO L280 TraceCheckUtils]: 1: Hoare triple {919#true} assume 0 == ~n;#res.base, #res.offset := 0, 0; {919#true} is VALID [2020-07-29 01:37:39,009 INFO L280 TraceCheckUtils]: 2: Hoare triple {919#true} assume true; {919#true} is VALID [2020-07-29 01:37:39,011 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {919#true} {934#(or (<= 1 new_ll_~head~0.base) (<= (+ new_ll_~head~0.base 1) 0))} #53#return; {934#(or (<= 1 new_ll_~head~0.base) (<= (+ new_ll_~head~0.base 1) 0))} is VALID [2020-07-29 01:37:39,011 INFO L280 TraceCheckUtils]: 0: Hoare triple {933#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~n := #in~n; {919#true} is VALID [2020-07-29 01:37:39,013 INFO L280 TraceCheckUtils]: 1: Hoare triple {919#true} 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); {934#(or (<= 1 new_ll_~head~0.base) (<= (+ new_ll_~head~0.base 1) 0))} is VALID [2020-07-29 01:37:39,015 INFO L263 TraceCheckUtils]: 2: Hoare triple {934#(or (<= 1 new_ll_~head~0.base) (<= (+ new_ll_~head~0.base 1) 0))} call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); {933#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-29 01:37:39,016 INFO L280 TraceCheckUtils]: 3: Hoare triple {933#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~n := #in~n; {919#true} is VALID [2020-07-29 01:37:39,016 INFO L280 TraceCheckUtils]: 4: Hoare triple {919#true} assume 0 == ~n;#res.base, #res.offset := 0, 0; {919#true} is VALID [2020-07-29 01:37:39,016 INFO L280 TraceCheckUtils]: 5: Hoare triple {919#true} assume true; {919#true} is VALID [2020-07-29 01:37:39,018 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {919#true} {934#(or (<= 1 new_ll_~head~0.base) (<= (+ new_ll_~head~0.base 1) 0))} #53#return; {934#(or (<= 1 new_ll_~head~0.base) (<= (+ new_ll_~head~0.base 1) 0))} is VALID [2020-07-29 01:37:39,019 INFO L280 TraceCheckUtils]: 7: Hoare triple {934#(or (<= 1 new_ll_~head~0.base) (<= (+ new_ll_~head~0.base 1) 0))} 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; {939#(or (<= 1 |new_ll_#res.base|) (<= (+ |new_ll_#res.base| 1) 0))} is VALID [2020-07-29 01:37:39,020 INFO L280 TraceCheckUtils]: 8: Hoare triple {939#(or (<= 1 |new_ll_#res.base|) (<= (+ |new_ll_#res.base| 1) 0))} assume true; {939#(or (<= 1 |new_ll_#res.base|) (<= (+ |new_ll_#res.base| 1) 0))} is VALID [2020-07-29 01:37:39,022 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {939#(or (<= 1 |new_ll_#res.base|) (<= (+ |new_ll_#res.base| 1) 0))} {919#true} #57#return; {931#(not (= 0 |ULTIMATE.start_main_#t~ret9.base|))} is VALID [2020-07-29 01:37:39,022 INFO L280 TraceCheckUtils]: 0: Hoare triple {919#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {919#true} is VALID [2020-07-29 01:37:39,023 INFO L280 TraceCheckUtils]: 1: Hoare triple {919#true} havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; {919#true} is VALID [2020-07-29 01:37:39,023 INFO L280 TraceCheckUtils]: 2: Hoare triple {919#true} assume !(main_~n~0 < 1); {919#true} is VALID [2020-07-29 01:37:39,025 INFO L263 TraceCheckUtils]: 3: Hoare triple {919#true} call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); {933#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-29 01:37:39,025 INFO L280 TraceCheckUtils]: 4: Hoare triple {933#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~n := #in~n; {919#true} is VALID [2020-07-29 01:37:39,027 INFO L280 TraceCheckUtils]: 5: Hoare triple {919#true} 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); {934#(or (<= 1 new_ll_~head~0.base) (<= (+ new_ll_~head~0.base 1) 0))} is VALID [2020-07-29 01:37:39,028 INFO L263 TraceCheckUtils]: 6: Hoare triple {934#(or (<= 1 new_ll_~head~0.base) (<= (+ new_ll_~head~0.base 1) 0))} call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); {933#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-29 01:37:39,029 INFO L280 TraceCheckUtils]: 7: Hoare triple {933#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~n := #in~n; {919#true} is VALID [2020-07-29 01:37:39,029 INFO L280 TraceCheckUtils]: 8: Hoare triple {919#true} assume 0 == ~n;#res.base, #res.offset := 0, 0; {919#true} is VALID [2020-07-29 01:37:39,029 INFO L280 TraceCheckUtils]: 9: Hoare triple {919#true} assume true; {919#true} is VALID [2020-07-29 01:37:39,031 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {919#true} {934#(or (<= 1 new_ll_~head~0.base) (<= (+ new_ll_~head~0.base 1) 0))} #53#return; {934#(or (<= 1 new_ll_~head~0.base) (<= (+ new_ll_~head~0.base 1) 0))} is VALID [2020-07-29 01:37:39,032 INFO L280 TraceCheckUtils]: 11: Hoare triple {934#(or (<= 1 new_ll_~head~0.base) (<= (+ new_ll_~head~0.base 1) 0))} 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; {939#(or (<= 1 |new_ll_#res.base|) (<= (+ |new_ll_#res.base| 1) 0))} is VALID [2020-07-29 01:37:39,036 INFO L280 TraceCheckUtils]: 12: Hoare triple {939#(or (<= 1 |new_ll_#res.base|) (<= (+ |new_ll_#res.base| 1) 0))} assume true; {939#(or (<= 1 |new_ll_#res.base|) (<= (+ |new_ll_#res.base| 1) 0))} is VALID [2020-07-29 01:37:39,038 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {939#(or (<= 1 |new_ll_#res.base|) (<= (+ |new_ll_#res.base| 1) 0))} {919#true} #57#return; {931#(not (= 0 |ULTIMATE.start_main_#t~ret9.base|))} is VALID [2020-07-29 01:37:39,040 INFO L280 TraceCheckUtils]: 14: Hoare triple {931#(not (= 0 |ULTIMATE.start_main_#t~ret9.base|))} 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; {932#(not (= 0 ULTIMATE.start_append_~x.base))} is VALID [2020-07-29 01:37:39,043 INFO L280 TraceCheckUtils]: 15: Hoare triple {932#(not (= 0 ULTIMATE.start_append_~x.base))} assume append_~x.base == 0 && append_~x.offset == 0;append_#res.base, append_#res.offset := append_~y.base, append_~y.offset; {920#false} is VALID [2020-07-29 01:37:39,043 INFO L280 TraceCheckUtils]: 16: Hoare triple {920#false} 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; {920#false} is VALID [2020-07-29 01:37:39,043 INFO L263 TraceCheckUtils]: 17: Hoare triple {920#false} call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset); {920#false} is VALID [2020-07-29 01:37:39,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:37:39,045 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57783554] [2020-07-29 01:37:39,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:37:39,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-29 01:37:39,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336952680] [2020-07-29 01:37:39,046 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:37:39,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:39,046 INFO L82 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 1 times [2020-07-29 01:37:39,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:39,047 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770120067] [2020-07-29 01:37:39,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:39,051 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:39,054 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:39,056 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:39,198 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-29 01:37:39,292 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-29 01:37:39,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:37:39,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:37:39,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:37:39,307 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 9 Second operand 7 states. [2020-07-29 01:37:39,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:39,620 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-29 01:37:39,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:37:39,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:37:39,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:39,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 41 transitions. [2020-07-29 01:37:39,661 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:37:39,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 41 transitions. [2020-07-29 01:37:39,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2020-07-29 01:37:39,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2020-07-29 01:37:39,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 41 transitions. [2020-07-29 01:37:39,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:37:39,664 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2020-07-29 01:37:39,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 41 transitions. [2020-07-29 01:37:39,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2020-07-29 01:37:39,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:39,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states and 41 transitions. Second operand 31 states. [2020-07-29 01:37:39,668 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states and 41 transitions. Second operand 31 states. [2020-07-29 01:37:39,668 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 31 states. [2020-07-29 01:37:39,668 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:39,672 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2020-07-29 01:37:39,672 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2020-07-29 01:37:39,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:39,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:39,673 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 36 states and 41 transitions. [2020-07-29 01:37:39,673 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 36 states and 41 transitions. [2020-07-29 01:37:39,674 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:39,678 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2020-07-29 01:37:39,679 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2020-07-29 01:37:39,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:39,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:39,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:39,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:39,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-29 01:37:39,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-07-29 01:37:39,682 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-29 01:37:39,682 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-29 01:37:39,682 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:37:39,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2020-07-29 01:37:39,683 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:37:39,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:39,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:39,684 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:37:39,684 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:37:39,684 INFO L794 eck$LassoCheckResult]: Stem: 1002#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 997#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; 998#L574 assume !(main_~n~0 < 1); 987#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 991#new_llENTRY ~n := #in~n; 1005#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); 986#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 992#new_llENTRY ~n := #in~n; 1006#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 1007#new_llFINAL assume true; 1003#new_llEXIT >#53#return; 1004#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; 1011#new_llFINAL assume true; 1008#new_llEXIT >#57#return; 993#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; 994#L563 assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; 1009#L566-3 call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); 995#L566-1 assume !(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0);havoc append_#t~mem6.base, append_#t~mem6.offset; 996#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; 989#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; 982#L579 call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset);< 981#lengthENTRY [2020-07-29 01:37:39,685 INFO L796 eck$LassoCheckResult]: Loop: 981#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 984#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); 983#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 981#lengthENTRY [2020-07-29 01:37:39,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:39,685 INFO L82 PathProgramCache]: Analyzing trace with hash -139719339, now seen corresponding path program 1 times [2020-07-29 01:37:39,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:39,685 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641877250] [2020-07-29 01:37:39,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:39,716 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:39,760 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:39,774 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:39,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:39,775 INFO L82 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 2 times [2020-07-29 01:37:39,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:39,776 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796608216] [2020-07-29 01:37:39,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:39,787 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:39,794 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:39,796 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:39,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:39,796 INFO L82 PathProgramCache]: Analyzing trace with hash -555510211, now seen corresponding path program 1 times [2020-07-29 01:37:39,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:39,797 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123774700] [2020-07-29 01:37:39,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:39,814 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:39,831 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:39,839 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:40,019 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-29 01:37:40,120 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-29 01:37:40,649 WARN L193 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 108 [2020-07-29 01:37:40,712 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 01:37:40,772 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:37:40,777 INFO L544 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 01:37:40,831 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:37:40,832 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-29 01:37:40,832 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:126, output treesize:102 [2020-07-29 01:37:41,014 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-07-29 01:37:41,988 WARN L193 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 147 [2020-07-29 01:37:42,106 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 01:37:42,278 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-07-29 01:37:42,279 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:37:42,280 INFO L544 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-07-29 01:37:42,281 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:203, output treesize:207 [2020-07-29 01:37:42,509 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-07-29 01:37:42,670 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-07-29 01:37:42,916 FATAL L488 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret9 := new_ll(~n~0); [2020-07-29 01:37:42,917 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.NonterminatingLassoResult.getLongDescription(NonterminatingLassoResult.java:69) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.reportResult(BuchiAutomizerObserver.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.interpretAndReportResult(BuchiAutomizerObserver.java:277) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:161) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-29 01:37:42,922 INFO L168 Benchmark]: Toolchain (without parser) took 12883.45 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 324.5 MB). Free memory was 958.9 MB in the beginning and 969.3 MB in the end (delta: -10.4 MB). Peak memory consumption was 452.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:42,923 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:37:42,924 INFO L168 Benchmark]: CACSL2BoogieTranslator took 634.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:42,924 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:42,925 INFO L168 Benchmark]: Boogie Preprocessor took 47.05 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-07-29 01:37:42,926 INFO L168 Benchmark]: RCFGBuilder took 564.81 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:42,926 INFO L168 Benchmark]: BuchiAutomizer took 11568.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 192.4 MB). Free memory was 1.1 GB in the beginning and 969.3 MB in the end (delta: 104.8 MB). Peak memory consumption was 435.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:42,929 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 634.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 564.81 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11568.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 192.4 MB). Free memory was 1.1 GB in the beginning and 969.3 MB in the end (delta: 104.8 MB). Peak memory consumption was 435.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(n) and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 14 locations. The remainder module has 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.4s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 8.9s. Construction of modules took 0.5s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 4. Automata minimization 0.1s 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: 62 SDtfs, 51 SDslu, 224 SDs, 0 SdLazy, 245 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s 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: unsat Degree: 0 Time: 23ms 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@64936d11=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4db125b5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@107b9edb=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@107b9edb=0, s=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@29dc4a04=0, xs=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@52672315=0, NULL=0, y=0, y=0, \result=0, x=0, y=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@38f964d8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@693bbc3c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@693bbc3c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4db125b5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@346344f6=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@29dc4a04=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@64936d11=0, x=0, NULL=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:216) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...