./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-linkedlists/cll_search-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/cll_search-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 34137da927ca86d2fb49adf8270ebc903b8c1dbe ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:37:22,695 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:37:22,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:37:22,718 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:37:22,719 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:37:22,721 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:37:22,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:37:22,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:37:22,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:37:22,743 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:37:22,745 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:37:22,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:37:22,747 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:37:22,750 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:37:22,751 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:37:22,752 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:37:22,754 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:37:22,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:37:22,758 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:37:22,762 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:37:22,767 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:37:22,771 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:37:22,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:37:22,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:37:22,777 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:37:22,778 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:37:22,778 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:37:22,780 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:37:22,780 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:37:22,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:37:22,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:37:22,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:37:22,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:37:22,785 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:37:22,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:37:22,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:37:22,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:37:22,789 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:37:22,789 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:37:22,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:37:22,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:37:22,792 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:22,809 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:37:22,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:37:22,811 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:37:22,811 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:37:22,811 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:37:22,812 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:37:22,812 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:37:22,812 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:37:22,813 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:37:22,813 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:37:22,813 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:37:22,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:37:22,814 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:37:22,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:37:22,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:37:22,815 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:37:22,815 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:37:22,815 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:37:22,815 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:37:22,816 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:37:22,816 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:37:22,816 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:37:22,817 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:37:22,817 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:37:22,817 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:37:22,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:37:22,818 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:37:22,818 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:37:22,819 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:37:22,820 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:37:22,820 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 -> 34137da927ca86d2fb49adf8270ebc903b8c1dbe [2020-07-29 01:37:23,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:37:23,178 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:37:23,183 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:37:23,186 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:37:23,187 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:37:23,188 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-linkedlists/cll_search-alloca-2.i [2020-07-29 01:37:23,254 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d64956528/bf6a090c222e41df91aebe78e8c09d8b/FLAG7825da6de [2020-07-29 01:37:23,866 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:37:23,867 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-linkedlists/cll_search-alloca-2.i [2020-07-29 01:37:23,882 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d64956528/bf6a090c222e41df91aebe78e8c09d8b/FLAG7825da6de [2020-07-29 01:37:24,130 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d64956528/bf6a090c222e41df91aebe78e8c09d8b [2020-07-29 01:37:24,134 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:37:24,136 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:37:24,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:37:24,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:37:24,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:37:24,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:37:24" (1/1) ... [2020-07-29 01:37:24,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e207ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:24, skipping insertion in model container [2020-07-29 01:37:24,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:37:24" (1/1) ... [2020-07-29 01:37:24,156 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:37:24,195 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:37:24,653 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:37:24,671 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:37:24,717 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:37:24,774 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:37:24,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:24 WrapperNode [2020-07-29 01:37:24,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:37:24,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:37:24,777 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:37:24,777 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:37:24,786 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:24" (1/1) ... [2020-07-29 01:37:24,804 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:24" (1/1) ... [2020-07-29 01:37:24,829 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:37:24,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:37:24,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:37:24,830 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:37:24,840 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:24" (1/1) ... [2020-07-29 01:37:24,841 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:24" (1/1) ... [2020-07-29 01:37:24,844 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:24" (1/1) ... [2020-07-29 01:37:24,845 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:24" (1/1) ... [2020-07-29 01:37:24,862 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:24" (1/1) ... [2020-07-29 01:37:24,871 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:24" (1/1) ... [2020-07-29 01:37:24,873 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:24" (1/1) ... [2020-07-29 01:37:24,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:37:24,881 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:37:24,881 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:37:24,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:37:24,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:24" (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:24,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:37:24,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:37:24,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:37:24,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 01:37:24,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 01:37:24,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:37:24,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:37:25,327 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:37:25,327 INFO L295 CfgBuilder]: Removed 10 assume(true) statements. [2020-07-29 01:37:25,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:37:25 BoogieIcfgContainer [2020-07-29 01:37:25,332 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:37:25,332 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:37:25,333 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:37:25,336 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:37:25,338 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:37:25,338 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:37:24" (1/3) ... [2020-07-29 01:37:25,339 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a8ce573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:37:25, skipping insertion in model container [2020-07-29 01:37:25,339 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:37:25,340 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:24" (2/3) ... [2020-07-29 01:37:25,340 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a8ce573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:37:25, skipping insertion in model container [2020-07-29 01:37:25,340 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:37:25,340 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:37:25" (3/3) ... [2020-07-29 01:37:25,342 INFO L371 chiAutomizerObserver]: Analyzing ICFG cll_search-alloca-2.i [2020-07-29 01:37:25,398 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:37:25,398 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:37:25,398 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:37:25,399 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:37:25,399 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:37:25,399 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:37:25,400 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:37:25,400 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:37:25,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-29 01:37:25,447 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:37:25,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:25,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:25,456 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:37:25,456 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:37:25,456 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:37:25,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-29 01:37:25,460 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:37:25,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:25,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:25,461 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:37:25,461 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:37:25,468 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~ret8.base, main_#t~ret8.offset, main_#t~nondet9, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7;init_cll_#in~n := main_~n~0;havoc init_cll_#res.base, init_cll_#res.offset;havoc init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset, init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~n, init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~n := init_cll_#in~n;havoc init_cll_~head~0.base, init_cll_~head~0.offset;call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.allocOnHeap(12);init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset;call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4);init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~i~0 := 1; 13#L552-3true [2020-07-29 01:37:25,468 INFO L796 eck$LassoCheckResult]: Loop: 13#L552-3true assume !!(init_cll_~i~0 < init_cll_~n);call init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset := #Ultimate.allocOnHeap(12);init_cll_~next_node~0.base, init_cll_~next_node~0.offset := init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset;call write~int(init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, 4);call write~$Pointer$(init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~curr~0.base, 4 + init_cll_~curr~0.offset, 8);init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_~next_node~0.base, init_cll_~next_node~0.offset; 11#L552-2true init_cll_#t~post3 := init_cll_~i~0;init_cll_~i~0 := 1 + init_cll_#t~post3;havoc init_cll_#t~post3; 13#L552-3true [2020-07-29 01:37:25,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:25,473 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 01:37:25,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:25,483 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507937541] [2020-07-29 01:37:25,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:25,584 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:25,603 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:25,628 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:25,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:25,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-07-29 01:37:25,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:25,630 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087456668] [2020-07-29 01:37:25,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:25,655 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:25,684 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:25,690 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:25,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:25,692 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-07-29 01:37:25,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:25,693 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622588674] [2020-07-29 01:37:25,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:25,738 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:25,785 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:25,804 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:26,112 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2020-07-29 01:37:26,269 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:26,417 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-07-29 01:37:26,419 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:37:26,430 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:26,548 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-07-29 01:37:26,549 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:37:26,554 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:26,555 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:156, output treesize:158 [2020-07-29 01:37:39,421 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:37:39,422 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_12|, |v_#memory_$Pointer$.offset_12|]. (let ((.cse1 (+ v_ULTIMATE.start_init_cll_~curr~0.offset_7 4))) (and (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_init_cll_#t~malloc4.base_3| 1)) (<= (+ v_ULTIMATE.start_init_cll_~curr~0.offset_7 12) (select |v_#length_8| v_ULTIMATE.start_init_cll_~curr~0.base_7)) (= (store |v_#memory_$Pointer$.base_11| v_ULTIMATE.start_init_cll_~next_node~0.base_3 (store (select |v_#memory_$Pointer$.base_11| v_ULTIMATE.start_init_cll_~next_node~0.base_3) v_ULTIMATE.start_init_cll_~next_node~0.offset_3 (select (select |v_#memory_$Pointer$.base_12| v_ULTIMATE.start_init_cll_~next_node~0.base_3) v_ULTIMATE.start_init_cll_~next_node~0.offset_3))) |v_#memory_$Pointer$.base_12|) (= v_ULTIMATE.start_init_cll_~curr~0.base_6 v_ULTIMATE.start_init_cll_~next_node~0.base_3) (= v_ULTIMATE.start_init_cll_~next_node~0.offset_3 v_ULTIMATE.start_init_cll_~curr~0.offset_6) (= |v_#memory_int_9| (let ((.cse0 (store |v_#memory_int_10| v_ULTIMATE.start_init_cll_~next_node~0.base_3 (store (select |v_#memory_int_10| v_ULTIMATE.start_init_cll_~next_node~0.base_3) v_ULTIMATE.start_init_cll_~next_node~0.offset_3 v_ULTIMATE.start_init_cll_~i~0_8)))) (store .cse0 v_ULTIMATE.start_init_cll_~curr~0.base_7 (store (select .cse0 v_ULTIMATE.start_init_cll_~curr~0.base_7) .cse1 (select (select |v_#memory_int_9| v_ULTIMATE.start_init_cll_~curr~0.base_7) .cse1))))) (< |v_ULTIMATE.start_init_cll_#t~malloc4.base_3| |v_#StackHeapBarrier_4|) (= 0 (select |v_#valid_11| |v_ULTIMATE.start_init_cll_#t~malloc4.base_3|)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_init_cll_~curr~0.base_7)) (= |v_#memory_$Pointer$.offset_10| (store |v_#memory_$Pointer$.offset_12| v_ULTIMATE.start_init_cll_~curr~0.base_7 (store (select |v_#memory_$Pointer$.offset_12| v_ULTIMATE.start_init_cll_~curr~0.base_7) .cse1 v_ULTIMATE.start_init_cll_~next_node~0.offset_3))) (= |v_#length_8| (store |v_#length_9| |v_ULTIMATE.start_init_cll_#t~malloc4.base_3| 12)) (= |v_ULTIMATE.start_init_cll_#t~malloc4.base_3| v_ULTIMATE.start_init_cll_~next_node~0.base_3) (= |v_ULTIMATE.start_init_cll_#t~malloc4.offset_3| v_ULTIMATE.start_init_cll_~next_node~0.offset_3) (<= 0 .cse1) (= |v_ULTIMATE.start_init_cll_#t~malloc4.offset_3| 0) (not (= 0 |v_ULTIMATE.start_init_cll_#t~malloc4.base_3|)) (= |v_#memory_$Pointer$.base_10| (store |v_#memory_$Pointer$.base_12| v_ULTIMATE.start_init_cll_~curr~0.base_7 (store (select |v_#memory_$Pointer$.base_12| v_ULTIMATE.start_init_cll_~curr~0.base_7) .cse1 v_ULTIMATE.start_init_cll_~next_node~0.base_3))) (= |v_#memory_$Pointer$.offset_12| (store |v_#memory_$Pointer$.offset_11| v_ULTIMATE.start_init_cll_~next_node~0.base_3 (store (select |v_#memory_$Pointer$.offset_11| v_ULTIMATE.start_init_cll_~next_node~0.base_3) v_ULTIMATE.start_init_cll_~next_node~0.offset_3 (select (select |v_#memory_$Pointer$.offset_12| v_ULTIMATE.start_init_cll_~next_node~0.base_3) v_ULTIMATE.start_init_cll_~next_node~0.offset_3)))) (< v_ULTIMATE.start_init_cll_~i~0_8 v_ULTIMATE.start_init_cll_~n_5) (= v_ULTIMATE.start_init_cll_~i~0_7 (+ v_ULTIMATE.start_init_cll_~i~0_8 1)))) [2020-07-29 01:37:39,423 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_DerPreprocessor_2, v_DerPreprocessor_1]. (let ((.cse1 (+ v_ULTIMATE.start_init_cll_~curr~0.offset_7 4))) (and (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_init_cll_#t~malloc4.base_3| 1)) (<= (+ v_ULTIMATE.start_init_cll_~curr~0.offset_7 12) (select |v_#length_8| v_ULTIMATE.start_init_cll_~curr~0.base_7)) (= v_ULTIMATE.start_init_cll_~curr~0.base_6 v_ULTIMATE.start_init_cll_~next_node~0.base_3) (= v_ULTIMATE.start_init_cll_~next_node~0.offset_3 v_ULTIMATE.start_init_cll_~curr~0.offset_6) (= |v_#memory_int_9| (let ((.cse0 (store |v_#memory_int_10| v_ULTIMATE.start_init_cll_~next_node~0.base_3 (store (select |v_#memory_int_10| v_ULTIMATE.start_init_cll_~next_node~0.base_3) v_ULTIMATE.start_init_cll_~next_node~0.offset_3 v_ULTIMATE.start_init_cll_~i~0_8)))) (store .cse0 v_ULTIMATE.start_init_cll_~curr~0.base_7 (store (select .cse0 v_ULTIMATE.start_init_cll_~curr~0.base_7) .cse1 (select (select |v_#memory_int_9| v_ULTIMATE.start_init_cll_~curr~0.base_7) .cse1))))) (< |v_ULTIMATE.start_init_cll_#t~malloc4.base_3| |v_#StackHeapBarrier_4|) (= |v_#memory_$Pointer$.offset_10| (let ((.cse2 (store |v_#memory_$Pointer$.offset_11| v_ULTIMATE.start_init_cll_~next_node~0.base_3 (store (select |v_#memory_$Pointer$.offset_11| v_ULTIMATE.start_init_cll_~next_node~0.base_3) v_ULTIMATE.start_init_cll_~next_node~0.offset_3 v_DerPreprocessor_2)))) (store .cse2 v_ULTIMATE.start_init_cll_~curr~0.base_7 (store (select .cse2 v_ULTIMATE.start_init_cll_~curr~0.base_7) .cse1 v_ULTIMATE.start_init_cll_~next_node~0.offset_3)))) (= 0 (select |v_#valid_11| |v_ULTIMATE.start_init_cll_#t~malloc4.base_3|)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_init_cll_~curr~0.base_7)) (= |v_#length_8| (store |v_#length_9| |v_ULTIMATE.start_init_cll_#t~malloc4.base_3| 12)) (= |v_ULTIMATE.start_init_cll_#t~malloc4.base_3| v_ULTIMATE.start_init_cll_~next_node~0.base_3) (= |v_ULTIMATE.start_init_cll_#t~malloc4.offset_3| v_ULTIMATE.start_init_cll_~next_node~0.offset_3) (<= 0 .cse1) (= |v_ULTIMATE.start_init_cll_#t~malloc4.offset_3| 0) (not (= 0 |v_ULTIMATE.start_init_cll_#t~malloc4.base_3|)) (< v_ULTIMATE.start_init_cll_~i~0_8 v_ULTIMATE.start_init_cll_~n_5) (= (let ((.cse3 (store |v_#memory_$Pointer$.base_11| v_ULTIMATE.start_init_cll_~next_node~0.base_3 (store (select |v_#memory_$Pointer$.base_11| v_ULTIMATE.start_init_cll_~next_node~0.base_3) v_ULTIMATE.start_init_cll_~next_node~0.offset_3 v_DerPreprocessor_1)))) (store .cse3 v_ULTIMATE.start_init_cll_~curr~0.base_7 (store (select .cse3 v_ULTIMATE.start_init_cll_~curr~0.base_7) .cse1 v_ULTIMATE.start_init_cll_~next_node~0.base_3))) |v_#memory_$Pointer$.base_10|) (= v_ULTIMATE.start_init_cll_~i~0_7 (+ v_ULTIMATE.start_init_cll_~i~0_8 1)))) [2020-07-29 01:37:39,746 WARN L193 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-07-29 01:37:39,952 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2020-07-29 01:37:40,077 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:37:40,078 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:37:40,078 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:37:40,078 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:37:40,079 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:37:40,079 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:40,079 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:37:40,079 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:37:40,080 INFO L133 ssoRankerPreferences]: Filename of dumped script: cll_search-alloca-2.i_Iteration1_Lasso [2020-07-29 01:37:40,080 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:37:40,081 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:37:40,138 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:40,149 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:40,153 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:40,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:40,162 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:40,169 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:40,176 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:40,181 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:40,186 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:40,192 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:40,198 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:40,202 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:40,675 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2020-07-29 01:37:40,689 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:41,598 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:37:41,604 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:41,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:41,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:41,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:41,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:41,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:41,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:41,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:41,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:41,635 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:41,677 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:41,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:41,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:41,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:41,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:41,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:41,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:41,681 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:41,682 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:41,715 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:41,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:41,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:41,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:41,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:41,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:41,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:41,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:41,721 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:41,754 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:41,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:41,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:41,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:41,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:41,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:41,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:41,758 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:41,759 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:41,791 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:41,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:41,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:41,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:41,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:41,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:41,794 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:41,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:41,796 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:41,823 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:41,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:41,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:41,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:41,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:41,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:41,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:41,832 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:41,855 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:41,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:41,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:41,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:41,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:41,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:41,858 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:41,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:41,864 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:41,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:41,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:41,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:41,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:41,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:41,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:41,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:41,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:41,902 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:41,927 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:41,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:41,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:41,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:41,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:41,931 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:41,931 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:41,938 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:41,962 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:41,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:41,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:41,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:41,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:41,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:41,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:41,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:41,967 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:41,992 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:41,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:41,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:41,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:41,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:41,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:41,994 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:41,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:41,995 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:42,020 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:42,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:42,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:42,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:42,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:42,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:42,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:42,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:42,025 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:42,052 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:42,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:42,054 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:42,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:42,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:42,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:42,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:42,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:42,061 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:42,086 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:42,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:42,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:42,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:42,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:42,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:42,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:42,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:42,092 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:42,120 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:42,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:42,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:42,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:42,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:42,136 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:42,137 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:42,149 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:42,173 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:42,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:42,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:42,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:42,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:42,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:42,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:42,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:42,179 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:42,202 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:42,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:42,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:42,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:42,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:42,207 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:42,207 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:42,215 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:42,258 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:42,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:42,260 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:42,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:42,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:42,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:42,261 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:42,261 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:42,263 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:42,286 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:42,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:42,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:42,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:42,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:42,291 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:42,292 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:42,296 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) [2020-07-29 01:37:42,322 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:42,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:42,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:42,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:42,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:42,329 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:42,329 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:42,338 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:37:42,358 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-07-29 01:37:42,359 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. 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:42,382 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:42,417 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:37:42,417 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:37:42,419 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_cll_~n, ULTIMATE.start_init_cll_~i~0) = 1*ULTIMATE.start_init_cll_~n - 1*ULTIMATE.start_init_cll_~i~0 Supporting invariants [] [2020-07-29 01:37:42,506 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 01:37:42,514 INFO L393 LassoCheck]: Loop: "assume !!(init_cll_~i~0 < init_cll_~n);call init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset := #Ultimate.allocOnHeap(12);init_cll_~next_node~0.base, init_cll_~next_node~0.offset := init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset;call write~int(init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, 4);call write~$Pointer$(init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~curr~0.base, 4 + init_cll_~curr~0.offset, 8);init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_~next_node~0.base, init_cll_~next_node~0.offset;" "init_cll_#t~post3 := init_cll_~i~0;init_cll_~i~0 := 1 + init_cll_#t~post3;havoc init_cll_#t~post3;" [2020-07-29 01:37:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:42,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:42,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:37:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:42,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:42,600 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {22#unseeded} is VALID [2020-07-29 01:37:42,601 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~ret8.base, main_#t~ret8.offset, main_#t~nondet9, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7;init_cll_#in~n := main_~n~0;havoc init_cll_#res.base, init_cll_#res.offset;havoc init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset, init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~n, init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~n := init_cll_#in~n;havoc init_cll_~head~0.base, init_cll_~head~0.offset;call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.allocOnHeap(12);init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset;call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4);init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~i~0 := 1; {22#unseeded} is VALID [2020-07-29 01:37:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:42,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:37:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:42,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:42,681 INFO L280 TraceCheckUtils]: 0: Hoare triple {25#(>= oldRank0 (+ ULTIMATE.start_init_cll_~n (* (- 1) ULTIMATE.start_init_cll_~i~0)))} assume !!(init_cll_~i~0 < init_cll_~n);call init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset := #Ultimate.allocOnHeap(12);init_cll_~next_node~0.base, init_cll_~next_node~0.offset := init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset;call write~int(init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, 4);call write~$Pointer$(init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~curr~0.base, 4 + init_cll_~curr~0.offset, 8);init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_~next_node~0.base, init_cll_~next_node~0.offset; {58#(and (<= ULTIMATE.start_init_cll_~n (+ ULTIMATE.start_init_cll_~i~0 oldRank0)) (< ULTIMATE.start_init_cll_~i~0 ULTIMATE.start_init_cll_~n))} is VALID [2020-07-29 01:37:42,683 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#(and (<= ULTIMATE.start_init_cll_~n (+ ULTIMATE.start_init_cll_~i~0 oldRank0)) (< ULTIMATE.start_init_cll_~i~0 ULTIMATE.start_init_cll_~n))} init_cll_#t~post3 := init_cll_~i~0;init_cll_~i~0 := 1 + init_cll_#t~post3;havoc init_cll_#t~post3; {50#(or (and (> oldRank0 (+ ULTIMATE.start_init_cll_~n (* (- 1) ULTIMATE.start_init_cll_~i~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:37:42,684 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:42,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:37:42,716 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:42,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:37:42,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,735 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:37:42,737 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 3 states. [2020-07-29 01:37:42,867 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 3 states. Result 30 states and 39 transitions. Complement of second has 7 states. [2020-07-29 01:37:42,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:37:42,870 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:42,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-29 01:37:42,875 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:37:42,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:42,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:42,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:37:42,883 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:37:42,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:42,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:42,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2020-07-29 01:37:42,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:42,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:42,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:42,894 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states. [2020-07-29 01:37:42,900 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:37:42,903 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:37:42,903 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:37:42,912 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:37:42,913 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:37:42,913 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 39 transitions. cyclomatic complexity: 13 [2020-07-29 01:37:42,913 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:37:42,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:37:42,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:37:42,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:37:42,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:42,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:42,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:42,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:42,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:42,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:42,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:37:42,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:37:42,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 13 Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:37:42,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:37:42,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:37:42,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:37:42,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:37:42,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:37:42,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:37:42,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:37:42,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:37:42,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:37:42,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:42,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:42,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:42,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:37:42,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:37:42,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:37:42,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:37:42,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:37:42,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:37:42,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:37:42,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:37:42,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:37:42,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:42,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:42,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:42,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:42,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:42,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:42,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:37:42,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:37:42,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:37:42,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,936 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:42,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:37:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2020-07-29 01:37:42,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:37:42,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:37:42,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:37:42,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:42,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. cyclomatic complexity: 13 [2020-07-29 01:37:42,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:42,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 9 states and 11 transitions. [2020-07-29 01:37:42,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:37:42,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:37:42,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2020-07-29 01:37:42,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:37:42,954 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-07-29 01:37:42,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2020-07-29 01:37:42,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-07-29 01:37:42,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:42,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 11 transitions. Second operand 9 states. [2020-07-29 01:37:42,977 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 11 transitions. Second operand 9 states. [2020-07-29 01:37:42,979 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 9 states. [2020-07-29 01:37:42,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:42,983 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-07-29 01:37:42,984 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2020-07-29 01:37:42,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:42,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:42,985 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states and 11 transitions. [2020-07-29 01:37:42,985 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states and 11 transitions. [2020-07-29 01:37:42,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:42,986 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-07-29 01:37:42,986 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2020-07-29 01:37:42,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:42,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:42,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:42,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:42,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:37:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2020-07-29 01:37:42,989 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-07-29 01:37:42,990 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-07-29 01:37:42,990 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:37:42,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2020-07-29 01:37:42,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:42,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:42,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:42,991 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:37:42,991 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:37:42,992 INFO L794 eck$LassoCheckResult]: Stem: 108#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 104#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8.base, main_#t~ret8.offset, main_#t~nondet9, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7;init_cll_#in~n := main_~n~0;havoc init_cll_#res.base, init_cll_#res.offset;havoc init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset, init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~n, init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~n := init_cll_#in~n;havoc init_cll_~head~0.base, init_cll_~head~0.offset;call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.allocOnHeap(12);init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset;call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4);init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~i~0 := 1; 105#L552-3 assume !(init_cll_~i~0 < init_cll_~n); 102#L552-4 call write~$Pointer$(init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, 4 + init_cll_~curr~0.offset, 8);init_cll_#res.base, init_cll_#res.offset := init_cll_~head~0.base, init_cll_~head~0.offset; 103#L559 main_#t~ret8.base, main_#t~ret8.offset := init_cll_#res.base, init_cll_#res.offset;main_~head~1.base, main_~head~1.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset;search_#in~head.base, search_#in~head.offset, search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet9;havoc search_#t~mem6.base, search_#t~mem6.offset, search_#t~mem5, search_~head.base, search_~head.offset, search_~i, search_~curr~1.base, search_~curr~1.offset;search_~head.base, search_~head.offset := search_#in~head.base, search_#in~head.offset;search_~i := search_#in~i;search_~curr~1.base, search_~curr~1.offset := search_~head.base, search_~head.offset; 107#L564-3 [2020-07-29 01:37:42,992 INFO L796 eck$LassoCheckResult]: Loop: 107#L564-3 call search_#t~mem5 := read~int(search_~curr~1.base, search_~curr~1.offset, 4); 106#L564-1 assume !!(search_#t~mem5 != search_~i);havoc search_#t~mem5;call search_#t~mem6.base, search_#t~mem6.offset := read~$Pointer$(search_~curr~1.base, 4 + search_~curr~1.offset, 8);search_~curr~1.base, search_~curr~1.offset := search_#t~mem6.base, search_#t~mem6.offset;havoc search_#t~mem6.base, search_#t~mem6.offset; 107#L564-3 [2020-07-29 01:37:42,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:42,992 INFO L82 PathProgramCache]: Analyzing trace with hash 28696935, now seen corresponding path program 1 times [2020-07-29 01:37:42,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:42,993 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059687055] [2020-07-29 01:37:42,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:43,009 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:43,040 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:43,054 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:43,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:43,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 1 times [2020-07-29 01:37:43,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:43,055 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311788667] [2020-07-29 01:37:43,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:43,067 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:43,079 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:43,081 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:43,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:43,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1807951500, now seen corresponding path program 1 times [2020-07-29 01:37:43,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:43,086 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321564362] [2020-07-29 01:37:43,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:43,118 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:43,141 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:43,148 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:43,731 WARN L193 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 115 [2020-07-29 01:37:43,800 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:43,983 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-07-29 01:37:43,983 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:37:43,990 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:44,137 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-07-29 01:37:44,138 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:37:44,140 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:44,140 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:189, output treesize:165 [2020-07-29 01:37:44,528 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-07-29 01:37:44,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:37:44 BoogieIcfgContainer [2020-07-29 01:37:44,587 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:37:44,588 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:37:44,589 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:37:44,589 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:37:44,590 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:37:25" (3/4) ... [2020-07-29 01:37:44,593 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-07-29 01:37:44,667 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:37:44,668 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:37:44,670 INFO L168 Benchmark]: Toolchain (without parser) took 20535.29 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 300.4 MB). Free memory was 956.2 MB in the beginning and 1.3 GB in the end (delta: -316.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:37:44,671 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:37:44,673 INFO L168 Benchmark]: CACSL2BoogieTranslator took 638.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:44,679 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.74 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:44,680 INFO L168 Benchmark]: Boogie Preprocessor took 50.98 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:44,682 INFO L168 Benchmark]: RCFGBuilder took 451.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:44,683 INFO L168 Benchmark]: BuchiAutomizer took 19254.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 154.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -185.3 MB). Peak memory consumption was 347.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:44,684 INFO L168 Benchmark]: Witness Printer took 80.41 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:44,699 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.39 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 638.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.74 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 50.98 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 451.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19254.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 154.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -185.3 MB). Peak memory consumption was 347.0 MB. Max. memory is 11.5 GB. * Witness Printer took 80.41 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 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 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. The remainder module has 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.1s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 18.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 9 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 10 SDtfs, 11 SDslu, 16 SDs, 0 SdLazy, 6 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital263 mio100 ax100 hnf100 lsp97 ukn43 mio100 lsp27 div100 bol100 ite100 ukn100 eq177 hnf92 smp100 dnf172 smp93 tf100 neg95 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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: 564]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=27298} State at position 1 is {i=1, NULL=0, curr=27297, \result=0, head=0, NULL=27298, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@42404826=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@48081fad=0, next_node=0, \result=27297, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6cc5c15e=2, next_node=0, head=27297, head=27297, \old(i)=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@42404826=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@406ffc0b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5c450a4b=27297, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@2827a5e4=0, i=2, curr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5742db44=0, head=27297, \old(n)=0, n=0, head=27297, head=0, n=0, head=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7348bef5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5742db44=0, curr=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7348bef5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5c450a4b=0, curr=27297, head=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 564]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L570] int n = __VERIFIER_nondet_int(); [L548] node_t* head; [L549] node_t* curr = malloc(sizeof(node_t)); [L550] curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] curr->next = head [L559] return head; [L571] node_t* head = init_cll(n); [L563] node_t* curr = head; Loop: [L564] EXPR curr->val [L564] COND TRUE curr->val != i [L565] EXPR curr->next [L565] curr = curr->next End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...