./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety-ext/tree_cnstr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/memsafety-ext/tree_cnstr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 66a6115d1da56800c2be9161dfbbac5b90c8a3d9 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-9a8b2e8 [2020-10-20 08:19:14,129 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 08:19:14,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 08:19:14,173 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 08:19:14,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 08:19:14,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 08:19:14,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 08:19:14,189 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 08:19:14,191 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 08:19:14,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 08:19:14,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 08:19:14,197 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 08:19:14,197 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 08:19:14,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 08:19:14,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 08:19:14,203 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 08:19:14,204 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 08:19:14,205 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 08:19:14,208 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 08:19:14,214 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 08:19:14,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 08:19:14,227 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 08:19:14,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 08:19:14,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 08:19:14,243 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 08:19:14,244 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 08:19:14,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 08:19:14,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 08:19:14,248 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 08:19:14,249 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 08:19:14,250 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 08:19:14,250 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 08:19:14,255 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 08:19:14,256 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 08:19:14,257 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 08:19:14,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 08:19:14,258 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 08:19:14,258 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 08:19:14,259 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 08:19:14,260 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 08:19:14,261 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 08:19:14,261 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 08:19:14,302 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 08:19:14,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 08:19:14,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 08:19:14,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 08:19:14,305 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 08:19:14,305 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 08:19:14,305 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 08:19:14,306 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 08:19:14,306 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 08:19:14,306 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 08:19:14,307 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 08:19:14,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 08:19:14,307 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 08:19:14,308 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 08:19:14,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 08:19:14,308 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 08:19:14,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 08:19:14,308 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 08:19:14,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 08:19:14,309 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 08:19:14,309 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 08:19:14,309 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 08:19:14,310 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 08:19:14,310 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 08:19:14,310 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 08:19:14,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 08:19:14,310 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 08:19:14,310 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 08:19:14,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 08:19:14,311 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 08:19:14,311 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 08:19:14,311 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 08:19:14,312 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 08:19:14,313 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 66a6115d1da56800c2be9161dfbbac5b90c8a3d9 [2020-10-20 08:19:14,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 08:19:14,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 08:19:14,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 08:19:14,561 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 08:19:14,561 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 08:19:14,562 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2020-10-20 08:19:14,641 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b0e66f35/d44b1e99ec6a42aaa9de1c3d20c7b16e/FLAGf0c5d374d [2020-10-20 08:19:15,206 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 08:19:15,207 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2020-10-20 08:19:15,221 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b0e66f35/d44b1e99ec6a42aaa9de1c3d20c7b16e/FLAGf0c5d374d [2020-10-20 08:19:15,545 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b0e66f35/d44b1e99ec6a42aaa9de1c3d20c7b16e [2020-10-20 08:19:15,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 08:19:15,555 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 08:19:15,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 08:19:15,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 08:19:15,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 08:19:15,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:19:15" (1/1) ... [2020-10-20 08:19:15,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@feaefc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:15, skipping insertion in model container [2020-10-20 08:19:15,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:19:15" (1/1) ... [2020-10-20 08:19:15,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 08:19:15,635 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 08:19:16,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:19:16,121 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 08:19:16,195 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:19:16,264 INFO L208 MainTranslator]: Completed translation [2020-10-20 08:19:16,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:16 WrapperNode [2020-10-20 08:19:16,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 08:19:16,268 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 08:19:16,268 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 08:19:16,268 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 08:19:16,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:16" (1/1) ... [2020-10-20 08:19:16,298 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:16" (1/1) ... [2020-10-20 08:19:16,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 08:19:16,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 08:19:16,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 08:19:16,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 08:19:16,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:16" (1/1) ... [2020-10-20 08:19:16,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:16" (1/1) ... [2020-10-20 08:19:16,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:16" (1/1) ... [2020-10-20 08:19:16,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:16" (1/1) ... [2020-10-20 08:19:16,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:16" (1/1) ... [2020-10-20 08:19:16,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:16" (1/1) ... [2020-10-20 08:19:16,356 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:16" (1/1) ... [2020-10-20 08:19:16,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 08:19:16,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 08:19:16,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 08:19:16,360 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 08:19:16,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:16,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-20 08:19:16,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-20 08:19:16,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 08:19:16,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-20 08:19:16,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 08:19:16,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 08:19:16,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 08:19:16,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 08:19:16,998 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 08:19:16,999 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-20 08:19:17,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:19:17 BoogieIcfgContainer [2020-10-20 08:19:17,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 08:19:17,004 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 08:19:17,005 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 08:19:17,008 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 08:19:17,009 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:19:17,010 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 08:19:15" (1/3) ... [2020-10-20 08:19:17,011 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48b3a475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:19:17, skipping insertion in model container [2020-10-20 08:19:17,011 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:19:17,011 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:16" (2/3) ... [2020-10-20 08:19:17,011 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48b3a475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:19:17, skipping insertion in model container [2020-10-20 08:19:17,011 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:19:17,012 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:19:17" (3/3) ... [2020-10-20 08:19:17,013 INFO L373 chiAutomizerObserver]: Analyzing ICFG tree_cnstr.i [2020-10-20 08:19:17,057 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 08:19:17,058 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 08:19:17,058 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 08:19:17,058 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 08:19:17,058 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 08:19:17,058 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 08:19:17,058 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 08:19:17,058 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 08:19:17,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-10-20 08:19:17,091 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-10-20 08:19:17,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:17,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:17,097 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 08:19:17,097 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 08:19:17,097 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 08:19:17,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-10-20 08:19:17,100 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-10-20 08:19:17,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:17,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:17,100 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 08:19:17,100 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 08:19:17,107 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 11#L-1true havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~short25, main_#t~mem29.base, main_#t~mem29.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 10#L545-2true [2020-10-20 08:19:17,107 INFO L796 eck$LassoCheckResult]: Loop: 10#L545-2true assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 8#L535-2true assume !true; 23#L534-5true call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 20#L540true assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem16.base, main_#t~mem16.offset, 4);havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);havoc main_#t~mem17.base, main_#t~mem17.offset; 26#L540-2true call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 6#L545true assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 10#L545-2true [2020-10-20 08:19:17,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:17,113 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 08:19:17,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:17,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24427443] [2020-10-20 08:19:17,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:17,263 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:17,287 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:17,312 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:17,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:17,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2020-10-20 08:19:17,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:17,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774785403] [2020-10-20 08:19:17,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:17,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:19:17,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774785403] [2020-10-20 08:19:17,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:19:17,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 08:19:17,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849172144] [2020-10-20 08:19:17,361 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:19:17,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:19:17,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 08:19:17,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 08:19:17,385 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2020-10-20 08:19:17,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:19:17,394 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2020-10-20 08:19:17,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 08:19:17,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2020-10-20 08:19:17,399 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-10-20 08:19:17,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 31 transitions. [2020-10-20 08:19:17,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-10-20 08:19:17,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-10-20 08:19:17,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 31 transitions. [2020-10-20 08:19:17,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:19:17,407 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2020-10-20 08:19:17,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 31 transitions. [2020-10-20 08:19:17,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-20 08:19:17,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-20 08:19:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2020-10-20 08:19:17,443 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2020-10-20 08:19:17,443 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2020-10-20 08:19:17,443 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 08:19:17,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. [2020-10-20 08:19:17,444 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-10-20 08:19:17,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:17,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:17,445 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 08:19:17,445 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:17,446 INFO L794 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 67#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~short25, main_#t~mem29.base, main_#t~mem29.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 62#L545-2 [2020-10-20 08:19:17,446 INFO L796 eck$LassoCheckResult]: Loop: 62#L545-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 59#L535-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 64#L534-1 assume main_#t~short9;call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short9 := main_#t~mem8.base != 0 || main_#t~mem8.offset != 0; 65#L534-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9; 72#L534-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 74#L540 assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem16.base, main_#t~mem16.offset, 4);havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);havoc main_#t~mem17.base, main_#t~mem17.offset; 75#L540-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 61#L545 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 62#L545-2 [2020-10-20 08:19:17,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:17,447 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-20 08:19:17,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:17,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937997972] [2020-10-20 08:19:17,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:17,466 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:17,482 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:17,489 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:17,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:17,490 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2020-10-20 08:19:17,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:17,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548198979] [2020-10-20 08:19:17,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:17,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:19:17,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548198979] [2020-10-20 08:19:17,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:19:17,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:19:17,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572817673] [2020-10-20 08:19:17,634 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:19:17,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:19:17,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:19:17,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:19:17,635 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. cyclomatic complexity: 13 Second operand 5 states. [2020-10-20 08:19:17,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:19:17,779 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2020-10-20 08:19:17,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:19:17,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 41 transitions. [2020-10-20 08:19:17,781 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2020-10-20 08:19:17,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 41 transitions. [2020-10-20 08:19:17,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-10-20 08:19:17,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-10-20 08:19:17,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 41 transitions. [2020-10-20 08:19:17,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:19:17,785 INFO L691 BuchiCegarLoop]: Abstraction has 27 states and 41 transitions. [2020-10-20 08:19:17,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 41 transitions. [2020-10-20 08:19:17,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2020-10-20 08:19:17,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-20 08:19:17,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2020-10-20 08:19:17,789 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2020-10-20 08:19:17,790 INFO L594 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2020-10-20 08:19:17,790 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 08:19:17,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2020-10-20 08:19:17,791 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-10-20 08:19:17,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:17,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:17,791 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 08:19:17,792 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:17,792 INFO L794 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 125#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~short25, main_#t~mem29.base, main_#t~mem29.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 119#L545-2 [2020-10-20 08:19:17,792 INFO L796 eck$LassoCheckResult]: Loop: 119#L545-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 116#L535-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 121#L534-1 assume main_#t~short9;call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short9 := main_#t~mem8.base != 0 || main_#t~mem8.offset != 0; 122#L534-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9; 134#L534-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 132#L540 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; 133#L540-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 118#L545 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 119#L545-2 [2020-10-20 08:19:17,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:17,792 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-10-20 08:19:17,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:17,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369820180] [2020-10-20 08:19:17,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:17,819 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:17,830 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:17,836 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:17,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:17,836 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2020-10-20 08:19:17,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:17,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971801400] [2020-10-20 08:19:17,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:17,846 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:17,852 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:17,856 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:17,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:17,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2020-10-20 08:19:17,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:17,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250945314] [2020-10-20 08:19:17,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:17,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:19:17,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250945314] [2020-10-20 08:19:17,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:19:17,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:19:17,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181493761] [2020-10-20 08:19:18,141 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2020-10-20 08:19:18,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:19:18,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:19:18,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:19:18,198 INFO L87 Difference]: Start difference. First operand 23 states and 35 transitions. cyclomatic complexity: 14 Second operand 5 states. [2020-10-20 08:19:18,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:19:18,498 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2020-10-20 08:19:18,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 08:19:18,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 80 transitions. [2020-10-20 08:19:18,501 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 44 [2020-10-20 08:19:18,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 80 transitions. [2020-10-20 08:19:18,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2020-10-20 08:19:18,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2020-10-20 08:19:18,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 80 transitions. [2020-10-20 08:19:18,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:19:18,504 INFO L691 BuchiCegarLoop]: Abstraction has 54 states and 80 transitions. [2020-10-20 08:19:18,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 80 transitions. [2020-10-20 08:19:18,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 31. [2020-10-20 08:19:18,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-20 08:19:18,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-10-20 08:19:18,508 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-10-20 08:19:18,508 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-10-20 08:19:18,508 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 08:19:18,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2020-10-20 08:19:18,509 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2020-10-20 08:19:18,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:18,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:18,510 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 08:19:18,510 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:18,510 INFO L794 eck$LassoCheckResult]: Stem: 221#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 217#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~short25, main_#t~mem29.base, main_#t~mem29.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 215#L545-2 [2020-10-20 08:19:18,510 INFO L796 eck$LassoCheckResult]: Loop: 215#L545-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 212#L535-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 213#L534-1 assume !main_#t~short9; 214#L534-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9; 234#L534-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 232#L540 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; 228#L540-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 229#L545 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 215#L545-2 [2020-10-20 08:19:18,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:18,511 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-10-20 08:19:18,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:18,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620285276] [2020-10-20 08:19:18,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:18,539 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:18,548 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:18,553 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:18,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:18,554 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2020-10-20 08:19:18,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:18,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541170120] [2020-10-20 08:19:18,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:18,562 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:18,568 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:18,571 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:18,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:18,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2020-10-20 08:19:18,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:18,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871914191] [2020-10-20 08:19:18,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:18,587 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:18,601 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:18,607 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:18,766 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2020-10-20 08:19:19,181 WARN L193 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 93 [2020-10-20 08:19:19,225 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 08:19:19,360 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-20 08:19:19,361 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:19:19,363 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 08:19:19,363 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:187, output treesize:175 [2020-10-20 08:19:19,495 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-20 08:19:19,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 08:19:19 BoogieIcfgContainer [2020-10-20 08:19:19,549 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 08:19:19,550 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 08:19:19,550 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 08:19:19,550 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 08:19:19,551 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:19:17" (3/4) ... [2020-10-20 08:19:19,554 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 08:19:19,614 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 08:19:19,615 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 08:19:19,617 INFO L168 Benchmark]: Toolchain (without parser) took 4067.04 ms. Allocated memory was 35.7 MB in the beginning and 62.4 MB in the end (delta: 26.7 MB). Free memory was 13.6 MB in the beginning and 22.9 MB in the end (delta: -9.3 MB). Peak memory consumption was 17.4 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:19,618 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 33.6 MB. Free memory was 9.4 MB in the beginning and 9.4 MB in the end (delta: 44.0 kB). Peak memory consumption was 44.0 kB. Max. memory is 14.3 GB. [2020-10-20 08:19:19,621 INFO L168 Benchmark]: CACSL2BoogieTranslator took 710.35 ms. Allocated memory was 35.7 MB in the beginning and 46.7 MB in the end (delta: 11.0 MB). Free memory was 12.7 MB in the beginning and 25.3 MB in the end (delta: -12.6 MB). Peak memory consumption was 12.1 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:19,622 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.10 ms. Allocated memory is still 46.7 MB. Free memory was 25.3 MB in the beginning and 23.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:19,626 INFO L168 Benchmark]: Boogie Preprocessor took 34.33 ms. Allocated memory is still 46.7 MB. Free memory was 23.1 MB in the beginning and 21.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:19,627 INFO L168 Benchmark]: RCFGBuilder took 643.75 ms. Allocated memory was 46.7 MB in the beginning and 47.7 MB in the end (delta: 1.0 MB). Free memory was 20.9 MB in the beginning and 23.0 MB in the end (delta: -2.1 MB). Peak memory consumption was 8.8 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:19,629 INFO L168 Benchmark]: BuchiAutomizer took 2545.14 ms. Allocated memory was 47.7 MB in the beginning and 62.4 MB in the end (delta: 14.7 MB). Free memory was 23.0 MB in the beginning and 25.2 MB in the end (delta: -2.3 MB). Peak memory consumption was 26.4 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:19,632 INFO L168 Benchmark]: Witness Printer took 65.31 ms. Allocated memory is still 62.4 MB. Free memory was 25.2 MB in the beginning and 22.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:19,644 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 33.6 MB. Free memory was 9.4 MB in the beginning and 9.4 MB in the end (delta: 44.0 kB). Peak memory consumption was 44.0 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 710.35 ms. Allocated memory was 35.7 MB in the beginning and 46.7 MB in the end (delta: 11.0 MB). Free memory was 12.7 MB in the beginning and 25.3 MB in the end (delta: -12.6 MB). Peak memory consumption was 12.1 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 57.10 ms. Allocated memory is still 46.7 MB. Free memory was 25.3 MB in the beginning and 23.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 34.33 ms. Allocated memory is still 46.7 MB. Free memory was 23.1 MB in the beginning and 21.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. * RCFGBuilder took 643.75 ms. Allocated memory was 46.7 MB in the beginning and 47.7 MB in the end (delta: 1.0 MB). Free memory was 20.9 MB in the beginning and 23.0 MB in the end (delta: -2.1 MB). Peak memory consumption was 8.8 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 2545.14 ms. Allocated memory was 47.7 MB in the beginning and 62.4 MB in the end (delta: 14.7 MB). Free memory was 23.0 MB in the beginning and 25.2 MB in the end (delta: -2.3 MB). Peak memory consumption was 26.4 MB. Max. memory is 14.3 GB. * Witness Printer took 65.31 ms. Allocated memory is still 62.4 MB. Free memory was 25.2 MB in the beginning and 22.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 27 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 55 SDslu, 69 SDs, 0 SdLazy, 134 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: 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: 532]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=7722} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5e14ed78=0, NULL=0, NULL=7724, NULL=7722, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@72b07045=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5452bf4d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@69f60b4c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5a0a951c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@61b9b89b=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@600d04cc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@19db8973=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5e14ed78=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5452bf4d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@75959b89=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@33122069=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@28a91ff3=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@47302e5f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@19db8973=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@76ebb590=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1a6cb53c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3968252=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1a6cb53c=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5a0a951c=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@600d04cc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@72b07045=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@792aaf01=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3c98bf67=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@511f91b8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3968252=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1dcab40f=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@76b0a8a3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@69f60b4c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6569741b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1687036c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@792aaf01=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1687036c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5cc9dc50=25, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@33122069=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@61b9b89b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@511f91b8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@76b0a8a3=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@338e4197=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6569741b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@60cf7f98=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@76ebb590=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1dcab40f=0, pred=0, NULL=7723, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3c98bf67=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 532]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L529] struct TreeNode* root = malloc(sizeof(*root)), *n; [L530] root->left = ((void *)0) [L531] root->right = ((void *)0) Loop: [L532] COND TRUE __VERIFIER_nondet_int() [L533] n = root [L534] EXPR n->left [L534] n->left && n->right [L534] COND FALSE !(n->left && n->right) [L540] EXPR n->left [L540] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L545] EXPR n->right [L545] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...