./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-linkedlists/cll_search-alloca_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-linkedlists/cll_search-alloca_false-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 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.24-2e94e6a [2019-01-01 21:54:33,096 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:54:33,098 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:54:33,111 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:54:33,112 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:54:33,113 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:54:33,114 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:54:33,116 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:54:33,118 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:54:33,119 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:54:33,120 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:54:33,120 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:54:33,121 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:54:33,122 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:54:33,123 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:54:33,124 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:54:33,125 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:54:33,127 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:54:33,129 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:54:33,131 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:54:33,132 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:54:33,134 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:54:33,136 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:54:33,137 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:54:33,137 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:54:33,138 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:54:33,139 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:54:33,140 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:54:33,141 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:54:33,142 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:54:33,142 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:54:33,143 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:54:33,143 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:54:33,144 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:54:33,145 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:54:33,146 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:54:33,146 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:54:33,185 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:54:33,187 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:54:33,188 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:54:33,190 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:54:33,190 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:54:33,190 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:54:33,191 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:54:33,191 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:54:33,191 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:54:33,191 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:54:33,191 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:54:33,192 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:54:33,193 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:54:33,193 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:54:33,193 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:54:33,193 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:54:33,193 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:54:33,195 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:54:33,195 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:54:33,196 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:54:33,196 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:54:33,196 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:54:33,197 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:54:33,197 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:54:33,197 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:54:33,197 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:54:33,197 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:54:33,199 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:54:33,200 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:54:33,201 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 34137da927ca86d2fb49adf8270ebc903b8c1dbe [2019-01-01 21:54:33,268 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:54:33,289 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:54:33,294 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:54:33,296 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:54:33,296 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:54:33,297 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-linkedlists/cll_search-alloca_false-termination.c.i [2019-01-01 21:54:33,370 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56159e775/2a21db85b7a24ba49cc7e42913e5a27f/FLAGe691e72ff [2019-01-01 21:54:34,035 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:54:34,038 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-linkedlists/cll_search-alloca_false-termination.c.i [2019-01-01 21:54:34,057 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56159e775/2a21db85b7a24ba49cc7e42913e5a27f/FLAGe691e72ff [2019-01-01 21:54:34,239 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56159e775/2a21db85b7a24ba49cc7e42913e5a27f [2019-01-01 21:54:34,243 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:54:34,245 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:54:34,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:54:34,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:54:34,251 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:54:34,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:54:34" (1/1) ... [2019-01-01 21:54:34,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dd9b2c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:34, skipping insertion in model container [2019-01-01 21:54:34,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:54:34" (1/1) ... [2019-01-01 21:54:34,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:54:34,326 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:54:34,743 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:54:34,760 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:54:34,904 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:54:34,986 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:54:34,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:34 WrapperNode [2019-01-01 21:54:34,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:54:34,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:54:34,988 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:54:34,988 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:54:35,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:34" (1/1) ... [2019-01-01 21:54:35,033 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:34" (1/1) ... [2019-01-01 21:54:35,068 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:54:35,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:54:35,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:54:35,070 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:54:35,081 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:34" (1/1) ... [2019-01-01 21:54:35,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:34" (1/1) ... [2019-01-01 21:54:35,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:34" (1/1) ... [2019-01-01 21:54:35,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:34" (1/1) ... [2019-01-01 21:54:35,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:34" (1/1) ... [2019-01-01 21:54:35,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:34" (1/1) ... [2019-01-01 21:54:35,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:34" (1/1) ... [2019-01-01 21:54:35,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:54:35,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:54:35,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:54:35,132 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:54:35,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:54:35,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:54:35,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:54:35,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 21:54:35,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 21:54:35,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 21:54:35,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:54:35,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:54:35,693 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:54:35,694 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2019-01-01 21:54:35,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:54:35 BoogieIcfgContainer [2019-01-01 21:54:35,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:54:35,695 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:54:35,695 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:54:35,700 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:54:35,701 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:54:35,701 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:54:34" (1/3) ... [2019-01-01 21:54:35,704 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50c9232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:54:35, skipping insertion in model container [2019-01-01 21:54:35,704 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:54:35,704 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:34" (2/3) ... [2019-01-01 21:54:35,705 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50c9232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:54:35, skipping insertion in model container [2019-01-01 21:54:35,705 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:54:35,705 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:54:35" (3/3) ... [2019-01-01 21:54:35,708 INFO L375 chiAutomizerObserver]: Analyzing ICFG cll_search-alloca_false-termination.c.i [2019-01-01 21:54:35,777 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:54:35,778 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:54:35,778 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:54:35,778 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:54:35,778 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:54:35,779 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:54:35,779 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:54:35,779 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:54:35,779 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:54:35,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-01 21:54:35,816 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 21:54:35,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:54:35,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:54:35,825 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:54:35,826 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:54:35,826 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:54:35,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-01 21:54:35,827 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 21:54:35,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:54:35,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:54:35,828 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:54:35,828 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:54:35,838 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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 [2019-01-01 21:54:35,838 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 [2019-01-01 21:54:35,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:35,846 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 21:54:35,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:35,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:35,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:35,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:35,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:36,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:36,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-01-01 21:54:36,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:36,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:36,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:36,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:36,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:36,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:36,060 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-01-01 21:54:36,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:36,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:36,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:36,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:36,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:36,865 WARN L181 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-01-01 21:54:36,910 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:36,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:37,146 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:37,181 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:37,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:37,406 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:156, output treesize:158 [2019-01-01 21:54:37,567 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-01-01 21:54:38,051 WARN L181 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-01-01 21:54:38,134 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:54:38,135 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:54:38,135 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:54:38,136 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:54:38,136 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:54:38,136 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:54:38,136 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:54:38,136 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:54:38,138 INFO L131 ssoRankerPreferences]: Filename of dumped script: cll_search-alloca_false-termination.c.i_Iteration1_Lasso [2019-01-01 21:54:38,138 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:54:38,138 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:54:38,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:38,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:38,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:38,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:38,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:38,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:38,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:38,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:38,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:38,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:38,466 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-01-01 21:54:38,736 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-01-01 21:54:38,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:38,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:38,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:39,199 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 21:54:39,487 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:54:39,494 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:54:39,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:39,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:39,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:39,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:39,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:39,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:39,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:39,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:39,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:39,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:39,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:39,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:39,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:39,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:39,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:39,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:39,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:39,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:39,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:39,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:39,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:39,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:39,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:39,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:39,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:39,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:39,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:39,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:39,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:39,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:39,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:39,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:39,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:39,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:39,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:39,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:39,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:39,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:39,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:39,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:39,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:39,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:39,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:39,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:39,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:39,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:39,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:39,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:39,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:39,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:39,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:39,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:39,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:39,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:39,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:39,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:39,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:39,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:39,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:39,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:39,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:39,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:39,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:39,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:39,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:39,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:39,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:39,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:39,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:39,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:39,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:39,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:39,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:39,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:39,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:39,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:39,560 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:39,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:39,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:39,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:39,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:39,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:39,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:39,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:39,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:39,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:39,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:39,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:39,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:39,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:39,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:39,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:39,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:39,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:39,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:39,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:39,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:39,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:39,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:39,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:39,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:39,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:39,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:39,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:39,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:39,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:39,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:39,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:39,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:39,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:39,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:39,585 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:39,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:39,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:39,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:39,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:39,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:39,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:39,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:39,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:39,628 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:39,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:39,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:39,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:39,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:39,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:39,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:39,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:39,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:39,646 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:39,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:39,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:39,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:39,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:39,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:39,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:39,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:39,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:39,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:39,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:39,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:39,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:39,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:39,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:39,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:39,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:39,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:39,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:39,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:39,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:39,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:39,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:39,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:39,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:39,704 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:39,733 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:54:39,762 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:54:39,763 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:54:39,767 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:54:39,770 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:54:39,771 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:54:39,771 INFO L520 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 [] [2019-01-01 21:54:39,792 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 21:54:39,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:39,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:39,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:39,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:54:39,930 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 [2019-01-01 21:54:39,931 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 3 states. [2019-01-01 21:54:40,003 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 3 states. Result 30 states and 39 transitions. Complement of second has 7 states. [2019-01-01 21:54:40,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:54:40,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:54:40,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2019-01-01 21:54:40,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-01 21:54:40,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:40,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:54:40,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:40,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 21:54:40,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:40,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-01-01 21:54:40,016 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:54:40,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 9 states and 11 transitions. [2019-01-01 21:54:40,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:54:40,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:54:40,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-01-01 21:54:40,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:54:40,024 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-01-01 21:54:40,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-01-01 21:54:40,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-01 21:54:40,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 21:54:40,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-01-01 21:54:40,053 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-01-01 21:54:40,053 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-01-01 21:54:40,053 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:54:40,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2019-01-01 21:54:40,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:54:40,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:54:40,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:54:40,056 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:54:40,056 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:54:40,057 INFO L794 eck$LassoCheckResult]: Stem: 99#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 93#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; 94#L552-3 assume !(init_cll_~i~0 < init_cll_~n); 95#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; 96#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; 98#L564-3 [2019-01-01 21:54:40,057 INFO L796 eck$LassoCheckResult]: Loop: 98#L564-3 call search_#t~mem5 := read~int(search_~curr~1.base, search_~curr~1.offset, 4); 97#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; 98#L564-3 [2019-01-01 21:54:40,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:40,058 INFO L82 PathProgramCache]: Analyzing trace with hash 28696935, now seen corresponding path program 1 times [2019-01-01 21:54:40,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:40,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:40,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:40,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:40,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:40,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:40,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 1 times [2019-01-01 21:54:40,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:40,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:40,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:40,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:40,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:40,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:40,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1807951500, now seen corresponding path program 1 times [2019-01-01 21:54:40,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:40,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:40,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:40,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:40,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:40,950 WARN L181 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2019-01-01 21:54:40,957 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:40,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:41,241 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:41,271 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:41,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 21:54:41,438 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:186, output treesize:162 [2019-01-01 21:54:41,586 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-01 21:54:41,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:54:41 BoogieIcfgContainer [2019-01-01 21:54:41,647 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:54:41,648 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:54:41,648 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:54:41,648 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:54:41,649 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:54:35" (3/4) ... [2019-01-01 21:54:41,655 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 21:54:41,763 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 21:54:41,763 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:54:41,766 INFO L168 Benchmark]: Toolchain (without parser) took 7521.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -158.3 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:54:41,769 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:54:41,770 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -115.0 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:54:41,773 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:54:41,774 INFO L168 Benchmark]: Boogie Preprocessor took 61.74 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:54:41,775 INFO L168 Benchmark]: RCFGBuilder took 562.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:54:41,778 INFO L168 Benchmark]: BuchiAutomizer took 5951.69 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 95.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -63.0 MB). Peak memory consumption was 312.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:54:41,780 INFO L168 Benchmark]: Witness Printer took 115.97 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 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-01 21:54:41,791 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 740.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -115.0 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.74 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 562.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5951.69 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 95.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -63.0 MB). Peak memory consumption was 312.4 MB. Max. memory is 11.5 GB. * Witness Printer took 115.97 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 B). Peak memory consumption was 24 B. 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 5.8s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 5.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. 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, 10 SDslu, 16 SDs, 0 SdLazy, 6 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital260 mio100 ax100 hnf100 lsp97 ukn43 mio100 lsp25 div100 bol100 ite100 ukn100 eq185 hnf92 smp100 dnf170 smp100 tf100 neg95 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms 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=-2} State at position 1 is {i=1, NULL=0, curr=-1, \result=0, head=0, NULL=-2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@34f82fca=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ec863b7=0, next_node=0, \result=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1bea58c5=3, next_node=0, head=-1, head=-1, \old(i)=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@34f82fca=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@18ab28f3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@c571554=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@7f720a9a=0, i=3, curr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b982c77=0, head=-1, \old(n)=0, n=0, head=-1, head=0, n=0, head=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@38b3a38b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b982c77=0, curr=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@38b3a38b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@c571554=0, curr=-1, 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...