./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.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/list-ext2-properties/list_and_tree_cnstr-2.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 356492c77ca30b45c8c64fdda8fe0cb19edee2c6 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 07:02:47,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 07:02:47,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 07:02:47,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 07:02:47,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 07:02:47,373 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 07:02:47,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 07:02:47,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 07:02:47,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 07:02:47,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 07:02:47,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 07:02:47,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 07:02:47,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 07:02:47,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 07:02:47,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 07:02:47,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 07:02:47,392 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 07:02:47,393 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 07:02:47,395 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 07:02:47,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 07:02:47,398 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 07:02:47,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 07:02:47,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 07:02:47,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 07:02:47,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 07:02:47,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 07:02:47,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 07:02:47,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 07:02:47,405 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 07:02:47,406 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 07:02:47,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 07:02:47,406 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 07:02:47,407 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 07:02:47,408 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 07:02:47,409 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 07:02:47,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 07:02:47,410 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 07:02:47,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 07:02:47,410 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 07:02:47,411 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 07:02:47,412 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 07:02:47,412 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 07:02:47,437 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 07:02:47,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 07:02:47,439 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 07:02:47,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 07:02:47,439 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 07:02:47,439 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 07:02:47,440 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 07:02:47,440 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 07:02:47,440 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 07:02:47,440 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 07:02:47,440 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 07:02:47,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 07:02:47,441 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 07:02:47,441 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 07:02:47,441 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 07:02:47,441 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 07:02:47,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 07:02:47,442 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 07:02:47,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 07:02:47,442 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 07:02:47,442 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 07:02:47,442 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 07:02:47,443 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 07:02:47,443 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 07:02:47,443 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 07:02:47,443 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 07:02:47,443 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 07:02:47,443 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 07:02:47,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 07:02:47,444 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 07:02:47,444 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 07:02:47,444 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 07:02:47,445 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 07:02:47,446 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 -> 356492c77ca30b45c8c64fdda8fe0cb19edee2c6 [2020-10-20 07:02:47,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 07:02:47,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 07:02:47,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 07:02:47,678 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 07:02:47,678 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 07:02:47,679 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i [2020-10-20 07:02:47,745 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deb3830be/f826e94799194f4e98d4161154169341/FLAGe8c85dbc5 [2020-10-20 07:02:48,245 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 07:02:48,246 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i [2020-10-20 07:02:48,259 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deb3830be/f826e94799194f4e98d4161154169341/FLAGe8c85dbc5 [2020-10-20 07:02:48,587 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deb3830be/f826e94799194f4e98d4161154169341 [2020-10-20 07:02:48,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 07:02:48,599 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 07:02:48,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 07:02:48,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 07:02:48,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 07:02:48,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 07:02:48" (1/1) ... [2020-10-20 07:02:48,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@524722f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:48, skipping insertion in model container [2020-10-20 07:02:48,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 07:02:48" (1/1) ... [2020-10-20 07:02:48,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 07:02:48,677 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 07:02:49,087 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 07:02:49,106 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 07:02:49,156 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 07:02:49,222 INFO L208 MainTranslator]: Completed translation [2020-10-20 07:02:49,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49 WrapperNode [2020-10-20 07:02:49,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 07:02:49,223 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 07:02:49,223 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 07:02:49,224 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 07:02:49,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... [2020-10-20 07:02:49,250 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... [2020-10-20 07:02:49,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 07:02:49,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 07:02:49,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 07:02:49,291 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 07:02:49,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... [2020-10-20 07:02:49,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... [2020-10-20 07:02:49,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... [2020-10-20 07:02:49,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... [2020-10-20 07:02:49,319 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... [2020-10-20 07:02:49,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... [2020-10-20 07:02:49,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... [2020-10-20 07:02:49,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 07:02:49,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 07:02:49,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 07:02:49,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 07:02:49,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (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 07:02:49,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 07:02:49,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 07:02:49,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-20 07:02:49,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-20 07:02:49,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 07:02:49,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-20 07:02:49,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 07:02:49,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 07:02:49,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 07:02:49,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 07:02:50,058 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 07:02:50,059 INFO L298 CfgBuilder]: Removed 20 assume(true) statements. [2020-10-20 07:02:50,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:02:50 BoogieIcfgContainer [2020-10-20 07:02:50,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 07:02:50,064 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 07:02:50,064 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 07:02:50,068 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 07:02:50,069 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:02:50,069 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 07:02:48" (1/3) ... [2020-10-20 07:02:50,072 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3db9f9e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 07:02:50, skipping insertion in model container [2020-10-20 07:02:50,074 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:02:50,074 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (2/3) ... [2020-10-20 07:02:50,075 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3db9f9e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 07:02:50, skipping insertion in model container [2020-10-20 07:02:50,075 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:02:50,075 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:02:50" (3/3) ... [2020-10-20 07:02:50,076 INFO L373 chiAutomizerObserver]: Analyzing ICFG list_and_tree_cnstr-2.i [2020-10-20 07:02:50,121 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 07:02:50,122 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 07:02:50,122 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 07:02:50,122 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 07:02:50,122 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 07:02:50,122 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 07:02:50,122 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 07:02:50,123 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 07:02:50,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2020-10-20 07:02:50,159 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2020-10-20 07:02:50,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:02:50,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:02:50,166 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:02:50,166 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 07:02:50,166 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 07:02:50,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2020-10-20 07:02:50,170 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2020-10-20 07:02:50,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:02:50,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:02:50,171 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:02:50,171 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 07:02:50,178 INFO L794 eck$LassoCheckResult]: Stem: 41#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(24); 14#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_#t~malloc30.base, main_#t~malloc30.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~malloc35.base, main_#t~malloc35.offset, main_#t~mem36.base, main_#t~mem36.offset, main_#t~nondet34, main_#t~mem38.base, main_#t~mem38.offset, main_#t~mem37, main_#t~mem40.base, main_#t~mem40.offset, main_#t~mem39, main_#t~mem41, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~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); 8#L568-2true [2020-10-20 07:02:50,179 INFO L796 eck$LassoCheckResult]: Loop: 8#L568-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; 32#L558-2true assume !true; 42#L557-5true call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 18#L563true assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;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; 25#L563-2true call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 4#L568true 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; 8#L568-2true [2020-10-20 07:02:50,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:50,184 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 07:02:50,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:50,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859451333] [2020-10-20 07:02:50,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:50,318 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:50,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:50,366 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:50,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:50,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2020-10-20 07:02:50,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:50,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217388230] [2020-10-20 07:02:50,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:02:50,402 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 07:02:50,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217388230] [2020-10-20 07:02:50,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:02:50,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 07:02:50,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137383253] [2020-10-20 07:02:50,409 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 07:02:50,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:02:50,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 07:02:50,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 07:02:50,423 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 2 states. [2020-10-20 07:02:50,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:02:50,432 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2020-10-20 07:02:50,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 07:02:50,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 63 transitions. [2020-10-20 07:02:50,437 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2020-10-20 07:02:50,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 37 states and 55 transitions. [2020-10-20 07:02:50,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2020-10-20 07:02:50,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2020-10-20 07:02:50,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 55 transitions. [2020-10-20 07:02:50,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:02:50,445 INFO L691 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2020-10-20 07:02:50,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 55 transitions. [2020-10-20 07:02:50,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-20 07:02:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-20 07:02:50,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2020-10-20 07:02:50,477 INFO L714 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2020-10-20 07:02:50,478 INFO L594 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2020-10-20 07:02:50,478 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 07:02:50,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 55 transitions. [2020-10-20 07:02:50,479 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2020-10-20 07:02:50,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:02:50,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:02:50,480 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:02:50,480 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:02:50,480 INFO L794 eck$LassoCheckResult]: Stem: 134#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(24); 120#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_#t~malloc30.base, main_#t~malloc30.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~malloc35.base, main_#t~malloc35.offset, main_#t~mem36.base, main_#t~mem36.offset, main_#t~nondet34, main_#t~mem38.base, main_#t~mem38.offset, main_#t~mem37, main_#t~mem40.base, main_#t~mem40.offset, main_#t~mem39, main_#t~mem41, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~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); 102#L568-2 [2020-10-20 07:02:50,480 INFO L796 eck$LassoCheckResult]: Loop: 102#L568-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; 107#L558-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; 104#L557-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; 105#L557-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~short9;havoc main_#t~mem8.base, main_#t~mem8.offset; 115#L557-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 122#L563 assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;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; 123#L563-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 101#L568 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; 102#L568-2 [2020-10-20 07:02:50,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:50,481 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-20 07:02:50,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:50,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353182270] [2020-10-20 07:02:50,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:50,500 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:50,518 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:50,526 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:50,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:50,527 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2020-10-20 07:02:50,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:50,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681765077] [2020-10-20 07:02:50,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:02:50,683 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 07:02:50,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681765077] [2020-10-20 07:02:50,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:02:50,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 07:02:50,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687189118] [2020-10-20 07:02:50,685 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 07:02:50,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:02:50,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 07:02:50,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 07:02:50,686 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. cyclomatic complexity: 27 Second operand 5 states. [2020-10-20 07:02:50,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:02:50,859 INFO L93 Difference]: Finished difference Result 44 states and 65 transitions. [2020-10-20 07:02:50,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 07:02:50,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 65 transitions. [2020-10-20 07:02:50,862 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2020-10-20 07:02:50,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 65 transitions. [2020-10-20 07:02:50,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2020-10-20 07:02:50,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-10-20 07:02:50,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 65 transitions. [2020-10-20 07:02:50,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:02:50,867 INFO L691 BuchiCegarLoop]: Abstraction has 44 states and 65 transitions. [2020-10-20 07:02:50,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 65 transitions. [2020-10-20 07:02:50,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2020-10-20 07:02:50,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-10-20 07:02:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2020-10-20 07:02:50,873 INFO L714 BuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2020-10-20 07:02:50,873 INFO L594 BuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2020-10-20 07:02:50,873 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 07:02:50,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 59 transitions. [2020-10-20 07:02:50,874 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 33 [2020-10-20 07:02:50,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:02:50,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:02:50,875 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:02:50,876 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:02:50,876 INFO L794 eck$LassoCheckResult]: Stem: 226#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(24); 209#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_#t~malloc30.base, main_#t~malloc30.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~malloc35.base, main_#t~malloc35.offset, main_#t~mem36.base, main_#t~mem36.offset, main_#t~nondet34, main_#t~mem38.base, main_#t~mem38.offset, main_#t~mem37, main_#t~mem40.base, main_#t~mem40.offset, main_#t~mem39, main_#t~mem41, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~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); 193#L568-2 [2020-10-20 07:02:50,876 INFO L796 eck$LassoCheckResult]: Loop: 193#L568-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; 199#L558-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; 195#L557-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; 196#L557-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~short9;havoc main_#t~mem8.base, main_#t~mem8.offset; 229#L557-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 214#L563 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; 215#L563-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 192#L568 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; 193#L568-2 [2020-10-20 07:02:50,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:50,877 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-10-20 07:02:50,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:50,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542734837] [2020-10-20 07:02:50,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:50,893 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:50,907 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:50,912 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:50,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:50,930 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2020-10-20 07:02:50,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:50,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650777665] [2020-10-20 07:02:50,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:50,962 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:50,981 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:50,989 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:50,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:50,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2020-10-20 07:02:50,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:50,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100316873] [2020-10-20 07:02:50,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:02:51,082 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 07:02:51,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100316873] [2020-10-20 07:02:51,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:02:51,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 07:02:51,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070121834] [2020-10-20 07:02:51,265 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2020-10-20 07:02:51,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:02:51,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 07:02:51,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 07:02:51,312 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. cyclomatic complexity: 28 Second operand 5 states. [2020-10-20 07:02:51,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:02:51,631 INFO L93 Difference]: Finished difference Result 92 states and 137 transitions. [2020-10-20 07:02:51,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 07:02:51,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 137 transitions. [2020-10-20 07:02:51,633 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 60 [2020-10-20 07:02:51,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 92 states and 137 transitions. [2020-10-20 07:02:51,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2020-10-20 07:02:51,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2020-10-20 07:02:51,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 137 transitions. [2020-10-20 07:02:51,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:02:51,637 INFO L691 BuchiCegarLoop]: Abstraction has 92 states and 137 transitions. [2020-10-20 07:02:51,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 137 transitions. [2020-10-20 07:02:51,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2020-10-20 07:02:51,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-20 07:02:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2020-10-20 07:02:51,642 INFO L714 BuchiCegarLoop]: Abstraction has 48 states and 69 transitions. [2020-10-20 07:02:51,642 INFO L594 BuchiCegarLoop]: Abstraction has 48 states and 69 transitions. [2020-10-20 07:02:51,642 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 07:02:51,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 69 transitions. [2020-10-20 07:02:51,643 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 41 [2020-10-20 07:02:51,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:02:51,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:02:51,644 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:02:51,644 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:02:51,645 INFO L794 eck$LassoCheckResult]: Stem: 375#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(24); 358#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_#t~malloc30.base, main_#t~malloc30.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~malloc35.base, main_#t~malloc35.offset, main_#t~mem36.base, main_#t~mem36.offset, main_#t~nondet34, main_#t~mem38.base, main_#t~mem38.offset, main_#t~mem37, main_#t~mem40.base, main_#t~mem40.offset, main_#t~mem39, main_#t~mem41, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~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); 339#L568-2 [2020-10-20 07:02:51,645 INFO L796 eck$LassoCheckResult]: Loop: 339#L568-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; 369#L558-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; 342#L557-1 assume !main_#t~short9; 343#L557-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~short9;havoc main_#t~mem8.base, main_#t~mem8.offset; 383#L557-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 380#L563 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; 381#L563-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 338#L568 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; 339#L568-2 [2020-10-20 07:02:51,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:51,645 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-10-20 07:02:51,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:51,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848318521] [2020-10-20 07:02:51,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:51,656 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:51,665 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:51,671 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:51,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:51,672 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2020-10-20 07:02:51,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:51,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881911556] [2020-10-20 07:02:51,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:51,680 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:51,685 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:51,689 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:51,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:51,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2020-10-20 07:02:51,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:51,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965244827] [2020-10-20 07:02:51,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:51,705 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:51,727 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:51,756 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:51,868 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2020-10-20 07:02:52,266 WARN L193 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 93 [2020-10-20 07:02:52,316 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 07:02:52,469 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-20 07:02:52,470 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:02:52,471 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 07:02:52,472 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:187, output treesize:175 [2020-10-20 07:02:52,614 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-20 07:02:52,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 07:02:52 BoogieIcfgContainer [2020-10-20 07:02:52,704 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 07:02:52,705 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 07:02:52,705 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 07:02:52,707 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 07:02:52,708 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:02:50" (3/4) ... [2020-10-20 07:02:52,712 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 07:02:52,812 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 07:02:52,812 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 07:02:52,818 INFO L168 Benchmark]: Toolchain (without parser) took 4223.63 ms. Allocated memory was 36.2 MB in the beginning and 63.4 MB in the end (delta: 27.3 MB). Free memory was 12.2 MB in the beginning and 14.9 MB in the end (delta: -2.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 14.3 GB. [2020-10-20 07:02:52,826 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 34.1 MB. Free memory was 19.3 MB in the beginning and 19.3 MB in the end (delta: 29.6 kB). Peak memory consumption was 29.6 kB. Max. memory is 14.3 GB. [2020-10-20 07:02:52,827 INFO L168 Benchmark]: CACSL2BoogieTranslator took 620.28 ms. Allocated memory was 36.2 MB in the beginning and 43.5 MB in the end (delta: 7.3 MB). Free memory was 11.3 MB in the beginning and 26.5 MB in the end (delta: -15.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 14.3 GB. [2020-10-20 07:02:52,831 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.17 ms. Allocated memory is still 43.5 MB. Free memory was 26.3 MB in the beginning and 23.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 14.3 GB. [2020-10-20 07:02:52,832 INFO L168 Benchmark]: Boogie Preprocessor took 42.68 ms. Allocated memory is still 43.5 MB. Free memory was 23.9 MB in the beginning and 21.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. [2020-10-20 07:02:52,833 INFO L168 Benchmark]: RCFGBuilder took 728.09 ms. Allocated memory was 43.5 MB in the beginning and 46.7 MB in the end (delta: 3.1 MB). Free memory was 21.4 MB in the beginning and 21.3 MB in the end (delta: 20.9 kB). Peak memory consumption was 15.0 MB. Max. memory is 14.3 GB. [2020-10-20 07:02:52,835 INFO L168 Benchmark]: BuchiAutomizer took 2640.26 ms. Allocated memory was 46.7 MB in the beginning and 63.4 MB in the end (delta: 16.8 MB). Free memory was 21.3 MB in the beginning and 16.8 MB in the end (delta: 4.5 MB). Peak memory consumption was 27.9 MB. Max. memory is 14.3 GB. [2020-10-20 07:02:52,838 INFO L168 Benchmark]: Witness Printer took 110.27 ms. Allocated memory is still 63.4 MB. Free memory was 16.8 MB in the beginning and 14.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. [2020-10-20 07:02:52,846 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.33 ms. Allocated memory is still 34.1 MB. Free memory was 19.3 MB in the beginning and 19.3 MB in the end (delta: 29.6 kB). Peak memory consumption was 29.6 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 620.28 ms. Allocated memory was 36.2 MB in the beginning and 43.5 MB in the end (delta: 7.3 MB). Free memory was 11.3 MB in the beginning and 26.5 MB in the end (delta: -15.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 67.17 ms. Allocated memory is still 43.5 MB. Free memory was 26.3 MB in the beginning and 23.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 42.68 ms. Allocated memory is still 43.5 MB. Free memory was 23.9 MB in the beginning and 21.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. * RCFGBuilder took 728.09 ms. Allocated memory was 43.5 MB in the beginning and 46.7 MB in the end (delta: 3.1 MB). Free memory was 21.4 MB in the beginning and 21.3 MB in the end (delta: 20.9 kB). Peak memory consumption was 15.0 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 2640.26 ms. Allocated memory was 46.7 MB in the beginning and 63.4 MB in the end (delta: 16.8 MB). Free memory was 21.3 MB in the beginning and 16.8 MB in the end (delta: 4.5 MB). Peak memory consumption was 27.9 MB. Max. memory is 14.3 GB. * Witness Printer took 110.27 ms. Allocated memory is still 63.4 MB. Free memory was 16.8 MB in the beginning and 14.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 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 48 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.3s. 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, 48 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 48 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 167 SDtfs, 71 SDslu, 179 SDs, 0 SdLazy, 191 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s 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: 555]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=16074} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@346ee22=0, NULL=0, NULL=16076, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@16a74819=0, NULL=16074, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@63040d29=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@59197abb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@755720c7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@c9027ab=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5994bc46=0, root=16073, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@64a97993=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@455acd21=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@346ee22=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@59197abb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3905acab=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@16a74819=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7c9c8127=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@416bc507=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@672fa5ac=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@50d4a6b8=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@135b2bd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@455acd21=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@34f3c38f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@34760a0f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2f2deeed=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@34760a0f=16073, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@c9027ab=0, a=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@64a97993=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@63040d29=0, p=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7ee56381=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4d4dab9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1231d49d=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@538d02bc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@956832a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@48f884d8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2f2deeed=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@36e0c766=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6c70af63=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@755720c7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@260836d6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2d483110=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1231d49d=0, n=16073, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2d483110=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@33eade4b=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6f2d7d94=0, t=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7e606af2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2241953b=23, p=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@36b5152c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4d4dab9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7c9c8127=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5994bc46=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@48f884d8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6c70af63=0, t=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@672fa5ac=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@4fcb3ef9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5fe9a473=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@260836d6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7ee56381=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@77ad3217=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@34f3c38f=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@36b5152c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1ab9e91d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@36e0c766=0, pred=0, NULL=16075, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@416bc507=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1ab9e91d=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@538d02bc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 555]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L553] root->left = ((void *)0) [L554] root->right = ((void *)0) Loop: [L555] COND TRUE __VERIFIER_nondet_int() [L556] n = root [L557] EXPR n->left [L557] n->left && n->right [L557] COND FALSE !(n->left && n->right) [L563] EXPR n->left [L563] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L568] EXPR n->right [L568] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...