./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec 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.5.800.v20200727-1323.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_parent_ptr.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 43439d71f7b47b10e5196ff582d5d2564aed0e67 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.2.1-dev-20ed64e [2021-08-27 17:39:59,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 17:39:59,434 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 17:39:59,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 17:39:59,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 17:39:59,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 17:39:59,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 17:39:59,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 17:39:59,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 17:39:59,480 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 17:39:59,481 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 17:39:59,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 17:39:59,484 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 17:39:59,487 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 17:39:59,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 17:39:59,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 17:39:59,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 17:39:59,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 17:39:59,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 17:39:59,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 17:39:59,499 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 17:39:59,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 17:39:59,501 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 17:39:59,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 17:39:59,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 17:39:59,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 17:39:59,509 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 17:39:59,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 17:39:59,510 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 17:39:59,511 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 17:39:59,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 17:39:59,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 17:39:59,513 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 17:39:59,514 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 17:39:59,515 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 17:39:59,515 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 17:39:59,516 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 17:39:59,516 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 17:39:59,516 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 17:39:59,517 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 17:39:59,518 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 17:39:59,518 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 17:39:59,540 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 17:39:59,540 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 17:39:59,541 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 17:39:59,541 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 17:39:59,541 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 17:39:59,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 17:39:59,542 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 17:39:59,542 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 17:39:59,542 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 17:39:59,542 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 17:39:59,542 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 17:39:59,542 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 17:39:59,543 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 17:39:59,543 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 17:39:59,543 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 17:39:59,543 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 17:39:59,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 17:39:59,543 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 17:39:59,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 17:39:59,543 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 17:39:59,544 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 17:39:59,544 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 17:39:59,544 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 17:39:59,544 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 17:39:59,544 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 17:39:59,544 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 17:39:59,544 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 17:39:59,545 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 17:39:59,545 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 17:39:59,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 17:39:59,545 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 17:39:59,545 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 17:39:59,546 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 17:39:59,546 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 43439d71f7b47b10e5196ff582d5d2564aed0e67 [2021-08-27 17:39:59,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 17:39:59,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 17:39:59,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 17:39:59,789 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 17:39:59,789 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 17:39:59,790 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2021-08-27 17:39:59,855 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0e131730/d0a08d8ca8034252a5640621ec6988ac/FLAG608511621 [2021-08-27 17:40:00,251 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 17:40:00,251 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2021-08-27 17:40:00,260 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0e131730/d0a08d8ca8034252a5640621ec6988ac/FLAG608511621 [2021-08-27 17:40:00,274 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0e131730/d0a08d8ca8034252a5640621ec6988ac [2021-08-27 17:40:00,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 17:40:00,278 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 17:40:00,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 17:40:00,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 17:40:00,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 17:40:00,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:40:00" (1/1) ... [2021-08-27 17:40:00,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@171e6eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:00, skipping insertion in model container [2021-08-27 17:40:00,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:40:00" (1/1) ... [2021-08-27 17:40:00,287 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 17:40:00,326 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 17:40:00,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:40:00,565 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 17:40:00,602 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:40:00,619 INFO L208 MainTranslator]: Completed translation [2021-08-27 17:40:00,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:00 WrapperNode [2021-08-27 17:40:00,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 17:40:00,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 17:40:00,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 17:40:00,626 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 17:40:00,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:00" (1/1) ... [2021-08-27 17:40:00,640 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:00" (1/1) ... [2021-08-27 17:40:00,658 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 17:40:00,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 17:40:00,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 17:40:00,660 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 17:40:00,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:00" (1/1) ... [2021-08-27 17:40:00,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:00" (1/1) ... [2021-08-27 17:40:00,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:00" (1/1) ... [2021-08-27 17:40:00,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:00" (1/1) ... [2021-08-27 17:40:00,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:00" (1/1) ... [2021-08-27 17:40:00,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:00" (1/1) ... [2021-08-27 17:40:00,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:00" (1/1) ... [2021-08-27 17:40:00,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 17:40:00,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 17:40:00,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 17:40:00,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 17:40:00,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:00" (1/1) ... [2021-08-27 17:40:00,706 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:40:00,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:00,726 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:40:00,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-27 17:40:00,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 17:40:00,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 17:40:00,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 17:40:00,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 17:40:00,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 17:40:00,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 17:40:00,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 17:40:00,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 17:40:01,272 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 17:40:01,273 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-27 17:40:01,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:40:01 BoogieIcfgContainer [2021-08-27 17:40:01,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 17:40:01,274 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 17:40:01,275 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 17:40:01,277 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 17:40:01,277 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:40:01,277 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 05:40:00" (1/3) ... [2021-08-27 17:40:01,278 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6201b7cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:40:01, skipping insertion in model container [2021-08-27 17:40:01,278 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:40:01,278 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:00" (2/3) ... [2021-08-27 17:40:01,278 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6201b7cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:40:01, skipping insertion in model container [2021-08-27 17:40:01,279 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:40:01,279 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:40:01" (3/3) ... [2021-08-27 17:40:01,279 INFO L389 chiAutomizerObserver]: Analyzing ICFG tree_parent_ptr.i [2021-08-27 17:40:01,318 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 17:40:01,319 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 17:40:01,319 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 17:40:01,319 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 17:40:01,319 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 17:40:01,319 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 17:40:01,319 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 17:40:01,319 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 17:40:01,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:40:01,345 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-08-27 17:40:01,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:01,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:01,350 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:40:01,350 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-08-27 17:40:01,351 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 17:40:01,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:40:01,353 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-08-27 17:40:01,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:01,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:01,354 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:40:01,354 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-08-27 17:40:01,358 INFO L791 eck$LassoCheckResult]: Stem: 5#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(18); 9#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~mem19.base, main_#t~mem19.offset, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~nondet6, main_#t~malloc25.base, main_#t~malloc25.offset, 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~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc 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);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 14#L552-2true [2021-08-27 17:40:01,359 INFO L793 eck$LassoCheckResult]: Loop: 14#L552-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; 22#L541-2true assume !true; 7#L540-5true call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 6#L546true 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(12);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, main_~n~0.offset, 4);havoc main_#t~malloc15.base, main_#t~malloc15.offset;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;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(main_~n~0.base, main_~n~0.offset, main_#t~mem18.base, 8 + main_#t~mem18.offset, 4);havoc main_#t~mem18.base, main_#t~mem18.offset; 16#L546-2true call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 12#L552true assume !((main_#t~mem19.base == 0 && main_#t~mem19.offset == 0) && 0 != main_#t~nondet20);havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~nondet20; 14#L552-2true [2021-08-27 17:40:01,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:01,363 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-27 17:40:01,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:01,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744357470] [2021-08-27 17:40:01,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:01,371 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:01,458 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:01,491 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:01,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:01,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2021-08-27 17:40:01,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:01,502 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089641147] [2021-08-27 17:40:01,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:01,502 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:01,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:01,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:40:01,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089641147] [2021-08-27 17:40:01,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089641147] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:40:01,558 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:40:01,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 17:40:01,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071285974] [2021-08-27 17:40:01,562 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 17:40:01,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:40:01,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-27 17:40:01,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 17:40:01,582 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:40:01,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:40:01,589 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2021-08-27 17:40:01,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-27 17:40:01,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2021-08-27 17:40:01,594 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-08-27 17:40:01,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2021-08-27 17:40:01,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-27 17:40:01,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-27 17:40:01,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2021-08-27 17:40:01,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:40:01,599 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-08-27 17:40:01,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2021-08-27 17:40:01,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-08-27 17:40:01,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:40:01,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2021-08-27 17:40:01,617 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-08-27 17:40:01,617 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-08-27 17:40:01,617 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 17:40:01,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2021-08-27 17:40:01,620 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-08-27 17:40:01,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:01,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:01,620 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:40:01,620 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:40:01,621 INFO L791 eck$LassoCheckResult]: Stem: 52#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(18); 53#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~mem19.base, main_#t~mem19.offset, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~nondet6, main_#t~malloc25.base, main_#t~malloc25.offset, 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~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc 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);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 61#L552-2 [2021-08-27 17:40:01,621 INFO L793 eck$LassoCheckResult]: Loop: 61#L552-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; 64#L541-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; 50#L540-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; 51#L540-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; 56#L540-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 54#L546 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(12);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, main_~n~0.offset, 4);havoc main_#t~malloc15.base, main_#t~malloc15.offset;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;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(main_~n~0.base, main_~n~0.offset, main_#t~mem18.base, 8 + main_#t~mem18.offset, 4);havoc main_#t~mem18.base, main_#t~mem18.offset; 55#L546-2 call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 62#L552 assume !((main_#t~mem19.base == 0 && main_#t~mem19.offset == 0) && 0 != main_#t~nondet20);havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~nondet20; 61#L552-2 [2021-08-27 17:40:01,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:01,622 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-08-27 17:40:01,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:01,622 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973102913] [2021-08-27 17:40:01,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:01,623 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:01,653 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:01,669 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:01,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:01,670 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2021-08-27 17:40:01,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:01,671 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399919193] [2021-08-27 17:40:01,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:01,671 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:01,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:01,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:40:01,812 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399919193] [2021-08-27 17:40:01,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399919193] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:40:01,812 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:40:01,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 17:40:01,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341570277] [2021-08-27 17:40:01,812 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 17:40:01,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:40:01,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 17:40:01,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 17:40:01,813 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:40:01,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:40:01,928 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2021-08-27 17:40:01,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 17:40:01,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2021-08-27 17:40:01,930 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2021-08-27 17:40:01,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2021-08-27 17:40:01,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-08-27 17:40:01,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-08-27 17:40:01,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2021-08-27 17:40:01,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:40:01,931 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2021-08-27 17:40:01,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2021-08-27 17:40:01,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2021-08-27 17:40:01,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:40:01,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2021-08-27 17:40:01,933 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-08-27 17:40:01,933 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-08-27 17:40:01,933 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 17:40:01,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2021-08-27 17:40:01,934 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-08-27 17:40:01,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:01,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:01,934 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:40:01,934 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:40:01,934 INFO L791 eck$LassoCheckResult]: Stem: 104#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(18); 105#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~mem19.base, main_#t~mem19.offset, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~nondet6, main_#t~malloc25.base, main_#t~malloc25.offset, 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~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc 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);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 111#L552-2 [2021-08-27 17:40:01,934 INFO L793 eck$LassoCheckResult]: Loop: 111#L552-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#L541-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; 101#L540-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; 102#L540-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; 108#L540-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 106#L546 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; 107#L546-2 call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 114#L552 assume !((main_#t~mem19.base == 0 && main_#t~mem19.offset == 0) && 0 != main_#t~nondet20);havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~nondet20; 111#L552-2 [2021-08-27 17:40:01,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:01,935 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-08-27 17:40:01,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:01,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756048466] [2021-08-27 17:40:01,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:01,935 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:01,959 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:01,977 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:01,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:01,979 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2021-08-27 17:40:01,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:01,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851058619] [2021-08-27 17:40:01,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:01,980 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:01,988 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:02,003 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:02,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:02,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2021-08-27 17:40:02,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:02,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113359535] [2021-08-27 17:40:02,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:02,009 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:02,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:02,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:40:02,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113359535] [2021-08-27 17:40:02,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113359535] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:40:02,100 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:40:02,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 17:40:02,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590589741] [2021-08-27 17:40:02,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:40:02,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 17:40:02,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 17:40:02,317 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:40:02,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:40:02,565 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2021-08-27 17:40:02,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 17:40:02,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2021-08-27 17:40:02,567 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2021-08-27 17:40:02,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2021-08-27 17:40:02,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-08-27 17:40:02,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-08-27 17:40:02,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2021-08-27 17:40:02,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:40:02,569 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 46 transitions. [2021-08-27 17:40:02,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2021-08-27 17:40:02,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2021-08-27 17:40:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:40:02,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2021-08-27 17:40:02,572 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2021-08-27 17:40:02,572 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2021-08-27 17:40:02,572 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 17:40:02,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2021-08-27 17:40:02,573 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2021-08-27 17:40:02,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:02,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:02,573 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:40:02,573 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:40:02,574 INFO L791 eck$LassoCheckResult]: Stem: 170#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(18); 171#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~mem19.base, main_#t~mem19.offset, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~nondet6, main_#t~malloc25.base, main_#t~malloc25.offset, 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~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc 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);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 177#L552-2 [2021-08-27 17:40:02,574 INFO L793 eck$LassoCheckResult]: Loop: 177#L552-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; 184#L541-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; 168#L540-1 assume !main_#t~short9; 169#L540-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; 195#L540-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 193#L546 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; 185#L546-2 call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 181#L552 assume !((main_#t~mem19.base == 0 && main_#t~mem19.offset == 0) && 0 != main_#t~nondet20);havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~nondet20; 177#L552-2 [2021-08-27 17:40:02,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:02,574 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-08-27 17:40:02,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:02,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991227871] [2021-08-27 17:40:02,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:02,575 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:02,584 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:02,593 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:02,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:02,594 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2021-08-27 17:40:02,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:02,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277183816] [2021-08-27 17:40:02,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:02,595 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:02,608 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:02,613 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:02,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:02,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2021-08-27 17:40:02,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:02,614 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546958136] [2021-08-27 17:40:02,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:02,614 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:02,622 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:02,649 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:03,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 05:40:03 BoogieIcfgContainer [2021-08-27 17:40:03,514 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 17:40:03,515 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 17:40:03,515 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 17:40:03,515 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 17:40:03,515 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:40:01" (3/4) ... [2021-08-27 17:40:03,517 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-08-27 17:40:03,545 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 17:40:03,545 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 17:40:03,546 INFO L168 Benchmark]: Toolchain (without parser) took 3267.86 ms. Allocated memory was 60.8 MB in the beginning and 90.2 MB in the end (delta: 29.4 MB). Free memory was 40.0 MB in the beginning and 48.1 MB in the end (delta: -8.1 MB). Peak memory consumption was 22.0 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:03,546 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 60.8 MB. Free memory was 42.7 MB in the beginning and 42.7 MB in the end (delta: 33.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:40:03,547 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.22 ms. Allocated memory is still 60.8 MB. Free memory was 39.7 MB in the beginning and 37.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:03,547 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.92 ms. Allocated memory is still 60.8 MB. Free memory was 37.1 MB in the beginning and 34.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:03,548 INFO L168 Benchmark]: Boogie Preprocessor took 36.17 ms. Allocated memory is still 60.8 MB. Free memory was 34.9 MB in the beginning and 33.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:03,548 INFO L168 Benchmark]: RCFGBuilder took 577.24 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 33.0 MB in the beginning and 48.6 MB in the end (delta: -15.6 MB). Peak memory consumption was 15.3 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:03,566 INFO L168 Benchmark]: BuchiAutomizer took 2239.80 ms. Allocated memory was 73.4 MB in the beginning and 90.2 MB in the end (delta: 16.8 MB). Free memory was 48.3 MB in the beginning and 49.3 MB in the end (delta: -1.1 MB). Peak memory consumption was 38.3 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:03,567 INFO L168 Benchmark]: Witness Printer took 30.69 ms. Allocated memory is still 90.2 MB. Free memory was 49.3 MB in the beginning and 48.1 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:03,569 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.17 ms. Allocated memory is still 60.8 MB. Free memory was 42.7 MB in the beginning and 42.7 MB in the end (delta: 33.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 346.22 ms. Allocated memory is still 60.8 MB. Free memory was 39.7 MB in the beginning and 37.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 33.92 ms. Allocated memory is still 60.8 MB. Free memory was 37.1 MB in the beginning and 34.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 36.17 ms. Allocated memory is still 60.8 MB. Free memory was 34.9 MB in the beginning and 33.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 577.24 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 33.0 MB in the beginning and 48.6 MB in the end (delta: -15.6 MB). Peak memory consumption was 15.3 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 2239.80 ms. Allocated memory was 73.4 MB in the beginning and 90.2 MB in the end (delta: 16.8 MB). Free memory was 48.3 MB in the beginning and 49.3 MB in the end (delta: -1.1 MB). Peak memory consumption was 38.3 MB. Max. memory is 16.1 GB. * Witness Printer took 30.69 ms. Allocated memory is still 90.2 MB. Free memory was 49.3 MB in the beginning and 48.1 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 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 28 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. 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 13.7ms AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 68 SDtfs, 29 SDslu, 60 SDs, 0 SdLazy, 100 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 261.8ms 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: 538]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=32661} State at position 1 is {s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6736d2ae=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@10b8370=0, NULL=32663, NULL=32661, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7cd69deb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@168bed9b=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@70485152=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@177580a6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6736d2ae=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@46643538=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3702fa5c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@178efb9d=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@62e5e8aa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@177580a6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6cc9119c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e3abdf3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@750f2c54=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e3abdf3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@168bed9b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@70485152=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4ab3d54e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1bf3c353=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@65a9f105=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@24c35cef=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2a6fb411=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@750f2c54=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@416ebbdc=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@50b48450=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4ab3d54e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7cd69deb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@64d96a24=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6976021e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@65a9f105=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6976021e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@26a00b7c=24, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1bf3c353=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@10b8370=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3702fa5c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@394bf01d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3fa53ed3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2a6fb411=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@50b48450=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@1e2577c6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@64d96a24=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3fa53ed3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@394bf01d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6cc9119c=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@178efb9d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@51196fc8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4c92c696=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@416ebbdc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4c92c696=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@29c2f6a8=0, NULL=32662, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@51196fc8=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@24c35cef=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 538]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L534] struct TreeNode* root = malloc(sizeof(*root)), *n; [L534] struct TreeNode* root = malloc(sizeof(*root)), *n; [L535] root->left = ((void *)0) [L536] root->right = ((void *)0) [L537] root->parent = ((void *)0) Loop: [L538] COND TRUE __VERIFIER_nondet_int() [L539] n = root [L540] EXPR n->left [L540] n->left && n->right [L540] COND FALSE !(n->left && n->right) [L546] EXPR n->left [L546] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L552] EXPR n->right [L552] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-08-27 17:40:03,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...